• 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.

• Journal of the military operations research society of Korea
• /
• v.12 no.1
• /
• pp.87-105
• /
• 1986

Among the various types of waiting line systems, the elevator servicing system is quite different from the usual queueing system in view of the service characteristics. For example, the FIFO discipline is not always valid depending upon the situation when the direction of first-come customer's is opposite of the operating elevator direction and at that time a later-arrived one has a luck to be served first. In this paper, a simulation model is constructed and tested by the sample data and the results have turned out to be fairly adequate. This model, therefore, will provide a good guide to anyone who is interested in the decision of optimal location selection of no-passenger elevator in high buildings whatsoever. This model is also available, with slight modification, to the problem of city bus dispatching or any other waiting line problems where the servicing equipments are moving.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.20 no.3
• /
• pp.61-68
• /
• 1983

In this paper various aspects of statistical maltiplexing of data signs have been investigated. A queueing model with finite waiting room and batch poisson arrivals is studied assuming that data signals are transmitted at a constant rate. Using traffic intensity and average burst length as parameters, overflow probabilities and expected queueing delay due to buffering are obtained. Also, a real system model of a statistical multiplexer that can be directly used in micro-programmed hardware realization is proposed. To examine the performance of the system, computer simulation has been done at various conditions. The results obtained can be used in designing a buffer efficiently.

• 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.

• Journal of the Korea Society for Simulation
• /
• v.3 no.1
• /
• pp.65-74
• /
• 1994

In the steady-state simulation, it is important to identify initialization bias for the correct estimates of the simulation model under study. In this paper, the methods from chaos theory are applied to the determination of truncation points in the simulation data for controlling the initial bias. Two methods are proposed and evaluated based on their effectiveness for estimation the average waiting time in M/M/1($\infty$) queueing model.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.2
• /
• pp.62-67
• /
• 2003

This paper deals with a First-Come, First-Served queueing model to analyze the behavior of heterogeneous finite source system with a single server Each sources and the processor are assumed to operate in independently Markovian environments, respectively. Each request is characterized by its own exponentially distributed source and service time with parameter depending on the state of the corresponding environment, that is, the arrival and service rates are subject to random fluctuations. Our aim is to get the usual stationary performance measures of the system, such as, utilizations, mean number of requests staying at the server, mean queue lengths, average waiting and sojourn times. In the case of fast arrivals or fast service asymptotic methods can be applied. In the intermediate situations stochastic simulation Is used. As applications of this model some problems in the field of telecommunications are treated.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.17 no.32
• /
• pp.53-62
• /
• 1994

This paper deals with the analysis of the PC communication service system performance which will be installed as a gateway between PSTN and PSDN. Firstly, we classify the data traffic pattern into interactive, conversational, and file transfer type from the actual statistics. Secondly, we model the system structure as a closed queueing network model with multiservers and multiple customer classes and derive the analytic method to be able to measure the system performance using Mean Value Analysis. Finally, the simulation results indicate that the analytic method obtained is a good approximation method to measure the system performance of the PC communication service system as a gateway between PSTN and PSDN.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1971-1978
• /
• 1999

In this paper, we study the effects of long-range dependence (LRD) in VBR video traffic on queueing system. This paper consists of Part I and II. In Part I, we present a (LRD) video traffic model based on the shifting-level (SL) process. We observe that the ACF of an empirical video trace is accurately captured by the shifting-level process with compound correlation (SLCC): an exponential function in short range and a hyperbolic function in long range. We present an accurate parameter matching algorithm for video traffic. In the Part II, we offer the queueing analysis of SL/D/1/K called ‘quantization reduction method’. Comparing the queueing performances of the DAR(1) model and the SLCC with that of a real video trace, we identify the effects of SRD and LRD in VBR video traffic on queueing performance. Simulation results show that Markoivian models can estimate network performances fairly accurately under a moderate traffic load and buffer condition, whereas LRD may have a significant effect on queueing behavior under a heavy traffic load and large buffer condition.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.4 no.4
• /
• pp.329-333
• /
• 2003

In this paper we analyze the performance of the low latency pre-registration handoff method of mobile IP by computer simulation. Packet losses and delays are evaluated in terms of system utilization. Foreign agents that participate in the handoff process can be modeled as queues representing input and output ports. Therefore, we propose an analytical model of pre-registration handoff by using open queueing network model. Simulation results are shown for validating analytical estimates.