Abstract
Underlying the fundamental queueing formulaL=λW is a relation between cumulative processes in continuous time (the integral of the queue length process) and in discrete time (the sum of the waiting times of successive customers). Except for remainder terms which usually are asymptotically negligible, each cumulative process is a random time-transformation of the other. As a consequence, in addition to the familiar relation between the with-prob ability-one limits of the averages, roughly speaking, the customer-average wait obeys a central limit theorem if and only if the time-average queue length obeys a central limit theorem, in which case both averages, properly normalized, converge in distribution jointly, and the individual limiting distributions are simply related. This relation between the central limit theorems is conveniently expressed in terms of functional central limit theorems, using the continuous mapping theorem and related arguments. The central limit theorems can be applied to compare the asymptotic efficiency of different estimators of queueing parameters. For example, when the arrival rateλ is known and the interarrivai times and waiting times are negatively correlated, it is more asymptotically efficient to estimate the long-run time-average queue lengthL indirectly by the sample-average of the waiting times, invokingL=λW, than it is to estimate it by the sample-average of the queue length. This variance-reduction principle extends a corresponding result for the standard GI/G/s model established by Carson and Law [2].
Similar content being viewed by others
References
P. Billingsley,Convergence of Probability Measures (Wiley, New York, 1968).
J.S. Carson and A.M. Law, Conservation equations and variance reduction in queueing simulations, Oper. Res. 28(1980)535.
W. Feller,An Introduction to Probability Theory and Its Applications, Vol. II, 2nd edition (Wiley, New York, 1971).
D.L. Iglehart and D.P. Kennedy, Weak convergence of the average of flag processes, J. Appl. Prob. 7(1970) 747.
D.L. Iglehart and W. Whitt, Multiple channel queues in heavy traffic, II: Sequences, networks and batches, Adv. Appl. Prob. 2(1970)355.
J.D.C. Little, A proof for the queueing formula:L=λW, Oper. Res. 9(1961)383.
T. Rolski and S. Stidham, Jr., Continuous versions of the queueing formulasL=λW andH=λG, Opel Res. Lett. 2(1983)211.
R.F. Serfozo, Functional limit theorems for stochastic processes based on embedded processes, Adv. Appl. Prob. 7(1975)123.
S. Stidham, Jr., A last word onL=λW, Opel Res. 22(1974)417.
S. Stidham, Jr., Sample-path analysis of queues, in:Applied Probability —Computer Science: The Interface, ed. R. Disney and T. Ott (Birkhauser, Boston, 1982).
D. Stoyan,Comparison Methods for Queues and Other Stochastic Models, ed. D.J. Daley (Wiley, New York, 1983).
V. Strassen, An invariance principle for the law of the iterated logarithm, Z. Wahrscheinlichkeitsth. 3(1964)211.
W. Whitt, Stochastic Abelian and Tauberian theorems, Z. Wahrscheinlichkeitsth. 22(1972) 251.
W. Whitt, Some useful functions for functional limit theorems, Math. Oper. Res. 5(1980)67.
M.J. Wichura, Functional laws of the iterated logarithm for the partial sums of i.i.d, random variables in the domain of attraction of a completely asymmetric stable law, Ann. Probab. 2(1974)1108.
Author information
Authors and Affiliations
Additional information
Supported by the National Science Foundation under Grant No. ECS-8404809 and by the U.S. Army under Contract No. DAAG29-80-C-0041.
Rights and permissions
About this article
Cite this article
Glynn, P.W., Whitt, W. A central-limit-theorem version ofL=λw. Queueing Syst 1, 191–215 (1986). https://doi.org/10.1007/BF01536188
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01536188