• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.16 no.28
• /
• pp.39-47
• /
• 1993

In this paper, We develop performance evaluation model for Twin fork Automated Storage/Retrieval systems. The system is modeled as a modified bulk service queueing system consisting of one exponential server with limited system capacity. The differance between this model and general bulk service queueing model is the inequality of transition service rate of each stage. The ejective of this model is to provide system characteristics for Twin fork AS/R system design problems, which are the number of customers in system, wait time in system and queue, the system queue size.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.39 no.2
• /
• pp.1-10
• /
• 2016

In this paper, we present a new way to derive the mean cycle time of the G/G/m failure prone queue when the loading of the system approaches to zero. The loading is the relative ratio of the arrival rate to the service rate multiplied by the number of servers. The system with low loading means the busy fraction of the system is low. The queueing system with low loading can be found in the semiconductor manufacturing process. Cluster tools in semiconductor manufacturing need a setup whenever the types of two successive lots are different. To setup a cluster tool, all wafers of preceding lot should be removed. Then, the waiting time of the next lot is zero excluding the setup time. This kind of situation can be regarded as the system with low loading. By employing absorbing Markov chain model and renewal theory, we propose a new way to derive the exact mean cycle time. In addition, using the proposed method, we present the cycle times of other types of queueing systems. For a queueing model with phase type service time distribution, we can obtain a two dimensional Markov chain model, which leads us to calculate the exact cycle time. The results also can be applied to a queueing model with batch arrivals. Our results can be employed to test the accuracy of existing or newly developed approximation methods. Furthermore, we provide intuitive interpretations to the results regarding the expected waiting time. The intuitive interpretations can be used to understand logically the characteristics of systems with low loading.

• 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 Institute of Control, Robotics and Systems
• /
• v.8 no.4
• /
• pp.288-291
• /
• 2002

We characterize multipath fading channel dynamics at the packet level and analyze the corresponding data queueing performance in various environments. We identify the similarity between wire-line queueing analysis and wireless network per-formance analysis. The second order channel statistics, i.e. channel power spectrum, is fecund to play an important role in the modeling of multipath fading channels. However, it is identified that the first order statistics, i.e. channel CDF also has significant impact on queueing performance. We use a special Markov chain, so-called CMPP, throughout this paper.

• 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 Society of Industrial and Systems Engineering
• /
• v.38 no.1
• /
• pp.21-29
• /
• 2015

A steady-state controllable M/G/1 queueing model operating under the {T:Min(T,N)} policy is considered where the {T:Min(T,N)} policy is defined as the next busy period will be initiated either after T time units elapsed from the end of the previous busy period if at least one customer arrives at the system during that time period, or after T time units elapsed without a customer' arrival, the time instant when Nth customer arrives at the system or T time units elapsed with at least one customer arrives at the system whichever comes first. After deriving the necessary system characteristics including the expected number of customers in the system, the expected length of busy period and so on, the total expected cost function per unit time for the system operation is constructed to determine the optimal operating policy. To do so, the cost elements associated with such system characteristics including the customers' waiting cost in the system and the server's removal and activating cost are defined. Then, procedures to determine the optimal values of the decision variables included in the operating policy are provided based on minimizing the total expected cost function per unit time to operate the queueing system under considerations.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.10C
• /
• pp.945-950
• /
• 2002

In this paper the performance evaluations on Asynchronous Transfer Mode(ATM) access node are performed in the ATM access network which consists of access node and channel. The performance factors of access node are Cell Loss Ratio(CLR), buffer capacity and delay time. Both the ATM cell-scale queueing model and burst-scale queueing model are considered as the traffic model of access node for various traffic types such as Constant Bit Rate(CBR), Variable Bit Rate(VBR) and random traffic in the ATM access networks. Based on these situations, the relation of CLR, buffer capacity and delay time is analyzed in the ATM access node.

• Proceedings of the Korean Society for Quality Management Conference
• /
• 2007.04a
• /
• pp.461-465
• /
• 2007

The BMAP/M/N/O queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is calculated. Loss probability and other performance measures are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.10a
• /
• pp.1-8
• /
• 2003

The traffic patterns of today's IP networks exhibit two important properties: self-similarity and long-range dependence. The fractional Brownian motion is widely used for representing the traffic model with the properties. We consider a single server fluid queueing system with input process of a fractional Brownian motion type. Formulas for effective bandwidth are derived in a single source and multiple source cases.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.30 no.4
• /
• pp.39-45
• /
• 2007

The BMAP/M/N/0 queueing system operating in Markovian random environment is investigated. The stationary distribution of the system is derived. Loss probability and other performance measures of the system also are calculated. Numerical experiments which show the necessity of taking into account the influence of random environment and correlation in input flow are presented.