• Journal of the Korea Society for Simulation
• /
• v.20 no.2
• /
• pp.1-10
• /
• 2011

In queueing network analysis, arrival processes are usually modeled as renewal processes by matching mean and variance. The renewal approximation simplifies the analysis and provides reasonably good estimate for the performance measures of the queueing systems under moderate conditions. However, high variability in arrival process or in service process requires more sophisticated approximation procedures for the variability parameter of departure/arrival processes. In this paper, we propose an heuristic approach to refine Whitt's variability function with the k-interval squared coefficient of variation also known as the index of dispersion for intervals(IDI). Regression analysis is used to establish an empirical relationships between the IDI of arrival process and the IDI of departure process of a queueing system.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.20 no.43
• /
• pp.153-162
• /
• 1997

M/G/1 queueing system is one of the most widely used one to model the real system. When operating a real systems, since it often takes cost, some control policies that change the operation scheme are adopted. In particular, the N-policy is the most popular among many control policies. Almost all researches on queueing system are based on the assumption that the arrival rates of customers into the queueing system is constant, In this paper, we consider the M/G/1 queueing system whose arrival rate varies according to the servers status : idle, set-up and busy states. For this study, we construct the steady state equations of queue lengths by means of the supplementary variable method, and derive the PGF(probability generating function) of them. The L-S-T(Laplace Stieltjes transform) of waiting time and average waiting time are also presented. We also develop an algorithm to find the optimal N-value from which the server starts his set-up. An analysis on the performance measures to minimize total operation cost of queueing system is included. We finally investigate the behavior of system operation cost as the optimal N and arrival rate change by a numerical study.

• Journal of the Korea Society for Simulation
• /
• v.23 no.3
• /
• pp.1-9
• /
• 2014

Traditional workflow time analyses have been performed treating an activity as an independent M/M/1queueing system. Using the general forms of performance measures in the M/M/1 system, various aspects of analyses can be performed. Especially, on the time analysis of an AND structure in a workflow system, the mean system sojourn time can be formalized by applying the performance measures of M/M/1 system. In the real workflow system, the AND structure cannot be described correctly under the assumption of independent M/M/1 systems. To overcome this limitation, this research makes the assumption that the all activities for a task starts simultaneously. In this situation, the theoretical solution can be derived using the performance measures of the M/G/1 system. In addition, the simulation modeling method will be proposed to analyze the AND structure of a real workflow system. Finally, some numerical results from the theoretical solutions and simulation models will be provided for verification. The main performance measures used in this research are mean queueing time and mean sojourn time.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1997.11a
• /
• pp.147-161
• /
• 1997

In the future, the performance of B-lSDN offering the multimedia and a various service depends on the performance of switch that is the important factor consisting of network. Bufferless banyan network consisted of MIN(multistage interconnection network) selected for- the fabric of ATM switch and has a limitation of performance because of blocking. Input buffered banyan networks with FIFO(first-in first-out) buffering scheme for the reduction of blocking and the cell bypass queueing theory for the reduction of HOL(head of line) blocking were seperately compared of the performance of switch. Specially input buffered banyan networks were applied monotonic buffering scheme that was proposed. As a result of simulation, Buffered Banyan Network with cell bypass queueing theory showed better performance than FIFO type input buffered Banyan network. Monotonic increase buffering scheme showed better performance than Monotonic decrease buffering scheme.

• Korean Journal of Construction Engineering and Management
• /
• v.23 no.6
• /
• pp.3-14
• /
• 2022

Quantitative analysis of the number of construction workers and construction period can present a new standard for appropriate personnel. This study presents a Queueing model that predicts the execution time of work procedures, the most important factor among work efficiency indicators. During the working cycle of apartment frame construction the same process tends to be repeated the volume of contruction. Based on these characteristics, this study used a Queueing Model and analyzed reference layer cycle of the delayed frame construction. After adjusting the number of people and the construction period, the performance of the model was analyzed and suggested. This study aims to support the decision making of personnel distribution according to the volume of construction by performing a performance analysis of the Queueing Model.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.3
• /
• pp.63-79
• /
• 2006

In this study we consider a CONWIP system in which the processing times at each station follow a Coxian distribution and the demands for the finished products arrive according to a compound Poisson process. The demands that are not satisfied immediately are either backordered or lost according to the number of demands that exist at their arrival Instants. For this system we develop an approximation method to calculate performance measures such as steady state probabilities of the number of parts at each station, proportion of lost demands and the mean number of backordered demands. For the analysis of the proposed CONWIP system, we model the CONWIP system as a closed queueing network with a synchronization station and analyze the closed queueing network using a product-form approximation method. A recursive technique is used to solve the subnetwork in the application of the product-form approximation method. To test the accuracy of the approximation method, the results obtained from the approximation method are compared with those obtained by simulation. Comparisons with simulation show that the approximation method provides fairly good results.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.2
• /
• pp.57-71
• /
• 2023

In this study, we analyze a finite-buffer M/G/1 queueing model with randomized pushout space priority and nonpreemptive time priority. Space and time priority queueing models have been extensively studied to analyze the performance of communication systems serving different types of traffic simultaneously: one type is sensitive to packet delay, and the other is sensitive to packet loss. However, these models have limitations. Some models assume that packet transmission times follow exponential distributions, which is not always realistic. Other models use general distributions for packet transmission times, but their space priority rules are too rigid, making it difficult to fine-tune service performance for different types of traffic. Our proposed model addresses these limitations and is more suitable for analyzing communication systems that handle different types of traffic with general packet length distributions. For the proposed queueing model, we first derive the distribution of the number of packets in the system when the transmission of each packet is completed, and we then obtain packet loss probabilities and the expected number of packets for each type of traffic. We also present a numerical example to explore the effect of a system parameter, the pushout probability, on system performance for different packet transmission time distributions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.27 no.1
• /
• pp.95-102
• /
• 2001

The design of automobile body assembly line is one of essential parts for improving the process performance. The major objective of this research is to develop a performance evaluation model for automobile assembly line using a closed queueing network(CQN) and simulation method. In this study we used a two-step approach to compute the performance of the assembly line : first, we used CQN model considering assembly line equipments and the line operating time under the assumption of no failure, and second we used a well-known simulator FACTOR/AIM. Finally we implemented this model on a K automobile company and we have shown the sample results of automobile body assembly line.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.1
• /
• pp.1-10
• /
• 1992

In the already presented paper, the performance analysis of SMUX was need a lot of time bacause of recussive method, So this paper proposed the new mathematical method for the SMUX's performance. And it is constructed and analyzed the queueing model for SMUX based on the Go-back N retransmission ARQ model. It is assumed that it has the infinite buffer and a single server. It is analzied the parameters that have influence on the byffer and a single server. It is analzied the parameters that have influence on the buffer behaviour of statistical multiplexer overflow probabilities. maximum buffer size. mean wating time and mean buffer size, and these relationship are represented the graphs and datas which provided a guide to the buffer design problem. As these results. it is efficient when the SMUX is apphed that the traffic density is below 0.5 and transmission error probabilities is below 10­$^3$. So this paper can be applied to the basic and theoretical background prior to the implementation of SMUX.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.29A no.11
• /
• pp.25-39
• /
• 1992

Due to the data processing development by the computer, the early warning system recently has made a remarkable evolution in its functions and performance as a component of the communication and control system which is also supported by the computer communication and intelligence system. In this paper it is presented that a integrated data processing system is designed to integrate the information sent from the various radar systems which constitute an early warning system. The suggested system model of this paper is devided into two types of structures, the centralized model and the distributed model, according to the data processing algorithm. We apply the queueing theory to analyse the performance of the designed models and the OPNET system kernel to make the analysing program with C language. From the analysis of the queueing components by applying the analysis programs to the designed systems, we got the tendancies and characteristics of both models, that is, a fast data processing performance of the distributed model and a stable data processing capability of the centralized model.