An approximation model for sojourn time distributions in acyclic multi-server queueing networks

We develop an approximation model for the sojourn time distribution of customers or jobs arriving to an acyclic multi-server queueing network. The model accepts general interarrival times and general service times, and is based on the characteristics of phase-type distributions. The model produces excellent results for multi-server networks with a small to medium number of workstations, but is less accurate when the number of workstations is large. HighlightsWe model the steady-state distribution of sojourn time of customers in an acyclic, multi-stage, multi-server queueing network.We use phase-type distributions to approximate waiting times and general processing times.The model can be used to predict the probability that time in a system will exceed a specified time.The model is especially effective for small- and medium-sized systems.

[1]  Søren Asmussen,et al.  Calculation of the Steady State Waiting Time Distribution in GI/PH/c and MAP/PH/c Queues , 2001, Queueing Syst. Theory Appl..

[2]  B. Sengupta.  Markov processes whose steady state distribution is matrix-exponential with an application to the GI/PH/1 queue , 1989, Advances in Applied Probability.

[3]  Min Young Chung,et al.  Performance evaluation using an approximation method for sojourn time distributions in an IN/ISDN signaling platform , 2002, Comput. Commun..

[4]  Javier Eduardo Rueda.  The Ph(t)/Ph(t)/s/c Queueing Model and Approximation , 2003 .

[5]  B. Conolly.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1991 .

[6]  Richard M. Feldman,et al.  Manufacturing Systems Modeling and Analysis , 2008 .

[7]  Alexander L. Stolyar,et al.  Queue Lengths and Waiting Times for Multiserver Queues with Abandonment and Retrials , 2002, Telecommun. Syst..

[8]  Min Young Chung,et al.  An approximation method for sojourn time distributions in telecommunication networks , 1998, ICC '98. 1998 IEEE International Conference on Communications. Conference Record. Affiliated with SUPERCOMM'98 (Cat. No.98CH36220).

[9]  Paul J. Schweitzer,et al.  Stochastic Models, an Algorithmic Approach , by Henk C. Tijms (Chichester: Wiley, 1994), 375 pages, paperback. , 1996, Probability in the Engineering and Informational Sciences.

[10]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[11]  Ward Whitt,et al.  Predicting Queueing Delays , 1999 .

[12]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[13]  J. Shanthikumar,et al.  Approximations for the time spent in a dynamic job shop with applications to due-date assignment , 1988 .

[14]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[15]  Colm Art O'Cinneide,et al.  Representations for matrix-geometric and matrix-exponential steady-state distributions with applications to many-server queues , 1998 .

[16]  K. Mani Chandy,et al.  Approximate Analysis of Central Server Models , 1975, IBM J. Res. Dev..

[17]  W. Whitt,et al.  Performance of the Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[18]  윤복식.  일반적인 큐잉네트워크에서의 체류시간분포의 근사화 ( An approximation Method for sojourn time distribution in general queuing network ) , 1994 .

[19]  Kevin R. Gue,et al.  Predicting departure times in multi-stage queueing systems , 2012, Comput. Oper. Res..

[20]  陸行,et al.  PH/PH/1 Queueing Models in Mathematica for Performance Evaluation , 2005 .