Heavy-Traffic Limits for Queues with Many Exponential Servers

Two different kinds of heavy-traffic limit theorems have been proved for s -server queues. The first kind involves a sequence of queueing systems having a fixed number of servers with an associated sequence of traffic intensities that converges to the critical value of one from below. The second kind, which is often not thought of as heavy traffic, involves a sequence of queueing systems in which the associated sequences of arrival rates and numbers of servers go to infinity while the service time distributions and the traffic intensities remain fixed, with the traffic intensities being less than the critical value of one. In each case the sequence of random variables depicting the steady-state number of customers waiting or being served diverges to infinity but converges to a nondegenerate limit after appropriate normalization. However, in an important respect neither procedure adequately represents a typical queueing system in practice because in the (heavy-traffic) limit an arriving customer is either almost certain to be delayed (first procedure) or almost certain not to be delayed (second procedure). Hence, we consider a sequence of ( GI / M / S ) systems in which the traffic intensities converge to one from below, the arrival rates and the numbers of servers go to infinity, but the steady-state probabilities that all servers are busy are held fixed. The limits in this case are hybrids of the limits in the other two cases. Numerical comparisons indicate that the resulting approximation is better than the earlier ones for many-server systems operating at typically encountered loads.

[1]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[2]  J. Kingman.  On Queues in Heavy Traffic , 1962 .

[3]  Charles Stone.  Limit theorems for random walks, birth and death processes, and diffusion processes , 1963 .

[4]  A. Borovkov.  Some Limit Theorems in the Theory of Mass Service , 1964 .

[5]  D. Iglehart.  Limiting diffusion approximations for the many server queue and the repairman problem , 1965 .

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[7]  A. Borovkov.  On limit laws for service processes in multi-channel systems , 1967 .

[8]  P. Billingsley,et al.  Convergence of Probability Measures , 1969 .

[9]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. I , 1970, Advances in Applied Probability.

[10]  D. Iglehart.  Multiple channel queues in heavy traffic , 1971, Advances in Applied Probability.

[11]  W. Whitt.  Embedded renewal processes in the GI/G/s queue , 1972, Journal of Applied Probability.

[12]  Robert B. Cooper,et al.  Introduction to Queueing Theory , 1973 .

[13]  D. Iglehart.  Weak convergence in queueing theory , 1973, Advances in Applied Probability.

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

[15]  D. Iglehart.  Weak convergence of compound stochastic process, I , 1973 .

[16]  T. Lindvall.  Weak convergence of probability measures and random functions in the function space D [0,∞) , 1973 .

[17]  J. Köllerström.  Heavy traffic theory for queues with several servers. II , 1974, Journal of Applied Probability.

[18]  Ward Whitt,et al.  Heavy Traffic Limit Theorems for Queues: A Survey , 1974 .

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

[20]  T. Kamae,et al.  Stochastic Inequalities on Partially Ordered Spaces , 1977 .

[21]  Jay J. Rhee.  The expectation value and the variance for the Poisson distribution , 1978 .

[22]  A. Lemoine.  State of the Art---Networks of Queues: A Survey of Weak Convergence Results , 1978 .

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

[24]  K. Mani Chandy,et al.  Approximate Methods for Analyzing Queueing Network Models of Computing Systems , 1978, CSUR.

[25]  J. Harrison.  The diffusion approximation for tandem queues in heavy traffic , 1978, Advances in Applied Probability.

[26]  D. W. Stroock,et al.  Multidimensional Diffusion Processes , 1979 .

[27]  Ward Whitt,et al.  Some Useful Functions for Functional Limit Theorems , 1980, Math. Oper. Res..

[28]  W. Whitt.  Comparing counting processes and queues , 1981, Advances in Applied Probability.

[29]  W. Whitt.  On the heavy-traffic limit theorem for GI/G/∞ queues , 1982 .