A Diffusion Approximation for the G/GI/n/m Queue

We develop a diffusion approximation for the queue-length stochastic process in theG/GI/n/m queueing model (having a general arrival process, independent and identically distributed service times with a general distribution,n servers, andm extra waiting spaces). We use the steady-state distribution of that diffusion process to obtain approximations for steady-state performance measures of the queueing model, focusing especially upon the steady-state delay probability. The approximations are based on heavy-traffic limits in whichn tends to infinity as the traffic intensity increases. Thus, the approximations are intended for largen.For theGI/M/n/8 special case, Halfin and Whitt (1981) showed that scaled versions of the queue-length process converge to a diffusion process when the traffic intensity? napproaches 1 with (1 -? n )v n ? I for 0 <I < 8. A companion paper, Whitt (2005), extends that limit to a special class ofG/GI/n/m nmodels in which the number of waiting places depends onn and the service-time distribution is a mixture of an exponential distribution with probabilityp and a unit point mass at 0 with probability 1 -p. Finite waiting rooms are treated by incorporating the additional limitm n/vn ? ? for 0 <? = 8. The approximation for the more generalG/GI/n/m model developed here is consistent with those heavy-traffic limits. Heavy-traffic limits for theGI/PH/n/8 model with phase-type service-time distributions established by Puhalskii and Reiman (2000) imply that our approximating process is not asymptotically correct for nonexponential phase-type service-time distributions, but nevertheless, the heuristic diffusion approximation developed here yields useful approximations for key performance measures such as the steady-state delay probability. The accuracy is confirmed by making comparisons with exact numerical results and simulations.

[1]  W. Whitt On approximations for queues, III: Mixtures of exponential distributions , 1984, AT&T Bell Laboratories Technical Journal.

[2]  Henk Tijms,et al.  Tables for multi-server queues , 1985 .

[3]  W. Whitt,et al.  PIECEWISE-LINEAR DIFFUSION PROCESSES , 1995 .

[4]  M. Reiman,et al.  The multiclass GI/PH/N queue in the Halfin-Whitt regime , 2000, Advances in Applied Probability.

[5]  W. Whitt,et al.  Heavy-traffic approximations for service systems with blocking , 1984, AT&T Bell Laboratories Technical Journal.

[6]  Ren Asmussen,et al.  Fitting Phase-type Distributions via the EM Algorithm , 1996 .

[7]  Avishai Mandelbaum,et al.  Telephone Call Centers: Tutorial, Review, and Research Prospects , 2003, Manuf. Serv. Oper. Manag..

[8]  S. A. Nozaki,et al.  Approximations in finite-capacity multi-server queues by Poisson arrivals , 1978, Journal of Applied Probability.

[9]  Ward Whitt,et al.  Understanding the Efficiency of Multi-Server Service Systems , 1992 .

[10]  W. Whitt Heavy-Traffic Limits for the G / H ∗ 2 / n / m Queue Ward Whitt , 2005 .

[11]  Sem C. Borst,et al.  Dimensioning Large Call Centers , 2000, Oper. Res..

[12]  Aleksandr Alekseevich Borovkov,et al.  Stochastic processes in queueing theory , 1976 .

[13]  Ward Whitt,et al.  Server Staffing to Meet Time-Varying Demand , 1996 .

[14]  Toshikazu Kimura,et al.  Diffusion Approximations for Queues with Markovian Bases , 2002, Ann. Oper. Res..

[15]  Susan L. Albin,et al.  Approximating a Point Process by a Renewal Process, II: Superposition Arrival Processes to Queues , 1984, Oper. Res..

[16]  Avishai Mandelbaum,et al.  Statistical Analysis of a Telephone Call Center , 2005 .

[17]  Anja Feldmann,et al.  Fitting mixtures of exponentials to long-tail distributions to analyze network performance models , 1997, Proceedings of INFOCOM '97.

[18]  A. Berger,et al.  Comparisons of multi-server queues with finite waiting rooms , 1992 .

[19]  Toshikazu Kimura Equivalence relations in the approximations for the M/G /s/s + r queue , 2000 .

[20]  Constantinos Maglaras,et al.  On Customer Contact Centers with a Call-Back Option: Customer Decisions, Routing Rules, and System Design , 2004, Oper. Res..

[21]  Ward Whitt,et al.  Departures from a Queue with Many Busy Servers , 1984, Math. Oper. Res..

[22]  Per Hokstad,et al.  Approximations for the M/G/m Queue , 1978, Oper. Res..

[23]  Ward Whitt,et al.  Heavy-Traffic Limits for Queues with Many Exponential Servers , 1981, Oper. Res..

[24]  Ward Whitt,et al.  Heavy-Traffic Limits for the G/H2*/n/mQueue , 2005, Math. Oper. Res..

[25]  Gordon F. Newell,et al.  Approximate Stochastic Behavior of n-Server Service Systems with Large n , 1973 .

[26]  Ward Whitt,et al.  Approximating a Point Process by a Renewal Process, I: Two Basic Methods , 1982, Oper. Res..

[27]  S. Albin On Poisson Approximations for Superposition Arrival Processes in Queues , 1982 .

[28]  R. Srikant,et al.  Simulation run lengths to estimate blocking probabilities , 1996, TOMC.

[29]  Ward Whitt,et al.  Heavy-Traffic Limits for Loss Proportions in Single-Server Queues , 2004, Queueing Syst. Theory Appl..

[30]  Ward Whitt,et al.  The Brownian approximation for rate-control throttles and the G/G/1/C queue , 1992, Discret. Event Dyn. Syst..

[31]  W. R. Franta,et al.  A Diffusion Approximation to the Multi-Server Queue , 1978 .

[32]  Vladimir A. Bolotin,et al.  Telephone Circuit Holding Time Distributions , 1994 .

[33]  J. Harrison,et al.  Brownian motion and stochastic flow systems , 1986 .

[34]  A. A. Borovkov,et al.  Asymptotic Methods in Queueing Theory. , 1986 .

[35]  W. Whitt Comparison conjectures about the M/G/ s queue , 1983 .

[36]  Predrag R. Jelenkovic,et al.  Heavy Traffic Limits for Queues with Many Deterministic Servers , 2004, Queueing Syst. Theory Appl..

[37]  Avishai Mandelbaum,et al.  Designing a Call Center with Impatient Customers , 2002, Manuf. Serv. Oper. Manag..

[38]  Ward Whitt How Multiserver Queues Scale with Growing Congestion-Dependent Demand , 2003, Oper. Res..

[39]  Toshikazu Kimura AnM/M/s-consistent diffusion model for theGI/G/s queue , 1995, Queueing Syst. Theory Appl..