A central-limit-theorem version ofL=λw

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].

[1]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[2]  Shaler Stidham,et al.  Technical Note - A Last Word on L = λW , 1974, Oper. Res..

[3]  D. Iglehart,et al.  Multiple channel queues in heavy traffic. II: sequences, networks, and batches , 1970, Advances in Applied Probability.

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

[5]  D. Iglehart,et al.  Weak convergence of the average of flag processes , 1970, Journal of Applied Probability.

[6]  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 , 1974 .

[7]  V. Strassen An invariance principle for the law of the iterated logarithm , 1964 .

[8]  Averill M. Law,et al.  Conservation equations and variance reduction in queueing simulations , 1977, WSC '77.

[9]  J. Little A Proof for the Queuing Formula: L = λW , 1961 .

[10]  R. Serfozo Functional limit theorems for stochastic processes based on embedded processes , 1975, Advances in Applied Probability.

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

[12]  Ward Whitt,et al.  Stochastic Abelian and Tauberian theorems , 1972 .

[13]  S. Stidham Sample-Path Analysis of Queues , 1982 .

[14]  S. Stidham,et al.  Continuous versions of the queuing formulas L = λW and H = λG , 1983 .

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