Abstract
A fundamental principle of queueing theory isL=λW (Little's law), which states that the time-average or expected time-stationary number of customers in a system is equal to the product of the arrival rate and the customer-average or expected customer-stationary time each customer spends in the system. This principle is now well known and frequently applied. However, in recent years there have been extensions, such as H=λG and the continuous, distributional, ordinal and central-limit-theorem versions, which show that theL=λW relation, when viewed properly, has much more power than was previously realized. Moreover, connections have been established between H=λG and other fundamental relations, such as the rate conservation law and PASTA (Poisson arrivals see time averages), which show that there is a much greater unity in the overall theory than was previously realized. This paper provides a review.
Similar content being viewed by others
References
F. Baccelli and P. Brémaud,Palm Probabilities and Stationary Queueing Systems, Lecture Notes in Statistics 41 (Springer, New York, 1987).
D.J. Bertsimas and D. Nakazato, The general distributional Little's law, Operations Research Center, MIT (1990).
P. Brémaud, Characteristics of queueing systems observed at events and the connection between stochastic intensity and Palm probability, Queueing Systems 5 (1989) 99–112.
P. Brémaud, An elementary proof of Sengupta's invariance relation and a remark on Miyazawa's conservation principle, J. Appl. Prob., to appear.
P. Brémaud, R. Kannurpatti and R. Mazumdar, Event and time averages: a review and some generalizations, Adv. Appl. Prob. 23 (1991), to appear.
P.H. Brill and M.J.M. Posner, Level crossing in point processes applied to queues: single-server case, Oper. Res. 25 (1977) 662–674.
P.H. Brill and M.J.M. Posner, The system point method in exponential queues: a level crossing approach, Math. Oper. Res. 6 (1981) 31–49.
S.L. Brumelle, On the relation between customer and time averages in queues, J. Appl. Prob. 8 (1971) 508–520.
S.L. Brumelle, A generalization ofL=λW to moments of queue length and waiting times, Oper. Res. 20 (1972) 1127–1136.
J.P. Buzen, Fundamental operational laws of computer system performance, Acta Informatica 7 (1976) 167–182.
J.S. Carson and A.M. Law, Conservation equations and variance reduction in queueing simulations, Oper. Res. 28 (1980) 535–546.
K.L. Chung,A Course in Probability Theory, 2nd ed. (Academic Press, New York, 1974).
A. Cobham, Priority assignment in waiting line problems, Oper. Res. 2 (1954) 70–76.
J.W. Cohen, On up- and downcrossings, J. Appl. Prob. 14 (1977) 405–410.
P.J. Denning, and J.P. Buzen, The operational analysis of queueing network models, Comp. Surveys 10 (1978) 225–261.
S. Eilon, A simpler proof ofL=λW, Oper. Res. 17 (1969) 915–917.
S.N. Ethier and T.G. Kurtz,Markov Processes, Characterization and Convergence (Wiley, New York, 1986).
H. Eves and C.V. Newson,An Introduction to the Foundations and Fundamental Concepts of Mathematics, 2nd ed. (Holt, Rinehart and Winston, New York, 1965).
J.M. Ferrandiz and A.A. Lazar, Rate conservation for stationary processes, J. Appl. Prob., to appear.
P. Franken, Some applications of the theory of stochastic point processes in queueing theory, Math. Nachr. 70 (1976) 303–319 (in German).
P. Franken, D. König, U. Arndt, and V. Schmidt,Queues and Point Processes, (AkademieVerlag, Berlin, 1981, and Wiley, New York, 1982).
P.W. Glynn and W. Whitt, A central limit theorem version ofL=λW, Queueing Systems 1 (1986) 191–215.
P.W. Glynn and W. Whitt, Sufficient conditions for functional-limit-theorem versions ofL=λW, Queueing Systems 1 (1987) 279–287.
P.W. Glynn and W. Whitt, Ordinary CLT and WLLN versions ofL=λW, Math. Oper. Res. 13 (1988) 674–692.
P.W. Glynn and W. Whitt, An LIL version ofL=λW, Math. Oper. Res. 13 (1988) 693–710.
P.W. Glynn and W. Whitt, Indirect estimation viaL=λW, Oper. Res. 37 (1989) 82–103.
P.W. Glynn and W. Whitt, Extensions of the queueing relationsL=λW and H=λG, Oper. Res. 37 (1989) 634–644.
P.W. Glynn and W. Whitt, The asymptotic efficiency of simulation estimators, Oper. Res. 40 (1992), to appear.
S. Halfin and W. Whitt, An extremal property of the FIFO discipline via an ordinal version ofL=λW, Commun. Statist.-Stochastic Models 5 (1989) 515–529.
R. Haji and G.F. Newell, A relation between stationary queue and waiting-time distributions, J. Appl. Prob. 8 (1971) 617–620.
D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, vol. 1 (McGraw-Hill, New York, 1982).
D.P. Heyman and S. Stidham, Jr., The relation between customer and time averages in queues, Oper. Res. 28 (1980) 983–994.
W.S. Jewell, A simple proof ofL=λW, Oper. Res. 15 (1967) 1109–1116.
J. Keilson and L.D. Servi, A distributional form of Little's law, Oper. Res. Lett. 7 (1988) 223–227.
J. Keilson and L.D. Servi, The distributional form of Little's law and the Fuhrmann-Cooper decomposition, Oper. Res. Lett. 9 (1990) 239–247.
D. König and V. Schmidt, Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes, J. Appl. Prob. 17 (1980) 753–767.
D. König and V. Schmidt, Relationships between time and customer stationary characteristics of queueing systems, in:Point Processes and Queueing Systems, eds. P. Bartfai and J. Tomko (North-Holland, Amsterdam, 1981) pp. 181–225.
D. König and V. Schmidt, EPSTA: the coincidence of time-stationary and customer-stationary distributions, Queueing Systems 5 (1989) 247–264.
M. Krakowski, Conservation methods in queueing theory, Rev. Franc. Automat. Inform. Rech. Oper. 7 (1973) 63–83.
A.M. Law, Efficient estimators for simulated queueing systems, Manag. Sci. 22 (1975) 30–41.
E.D. Lazowska, J. Zahorjan, G.S. Graham and K.C. Sevcik,Quantitative System Performance, Computer System Analysis Using Queueing Network Models (Prentice-Hall, Englewood Cliffs, NJ, 1984).
J.D.C. Little, A proof for the queueing formula:L=λW, Oper. Res. 9 (1961) 383–387.
W.L. Maxwell, On the generality of the equationL=λW, Oper. Res. 18 (1970) 172–174.
R. Mazumdar, R. Kannurpatti and C. Rosenberg, On rate conservation law for non-stationary processes, J. Appl. Prob., to appear.
J. McKenna, A generalization of Little's law to moments of queue lengths and waiting times in closed, product-form queueing networks, J. Appl. Prob. 26 (1989) 121–133.
B. Melamed and W. Whitt, On arrivals that see time averages, Oper. Res. 38 (1990) 156–172.
M. Miyazawa, Time and customer processes in queues with stationary inputs, J. Appl. Prob. 14 (1977) 349–357.
M. Miyazawa, A formal approach to queueing processes in the steady state and their applications, J. Appl. Prob. 16 (1979) 332–346.
M. Miyazawa, The derivation of invariance relations in complex queueing systems with stationary inputs, Adv. Appl. Prob. 15 (1983) 874–885.
M. Miyazawa, The intensity conservation law for queues with randomly changed service rate, J. Appl. Prob. 22 (1985) 408–418.
M. Miyazawa, Derivation of Little's and related formulas by rate conservation law with multiplicity, Department of Information Sciences, Science University of Tokyo (1990).
P.M. Morse,Queues, Inventories and Maintenance (Wiley, New York, 1958).
G.F. Newell,Applications of Queueing Theory (Chapman and Hall, London, 1971).
A. Nozari and W. Whitt, Estimating average production intervals using inventory measurements: Little's law for partially observable processes, Oper. Res. 36 (1988) 308–323.
M.G. Ramalhoto, J.A. Amaral, and M.T. Cochita, A survey of J. Little's formula, Int. Stat. Rev. 51 (1983) 255–278.
S.O. Rice, Single-server systems — I. relations between some averages, Bell Sys. Tech. J. 11 (1962) 269–278.
T. Rolski,Stationary Random Processes Associated with Point Processes, Lecture Notes in Statistics 5 (Springer, New York, 1981).
T. Rolski and S. Stidham, Jr., Continuous versions of the queueing formulasL=λW and H=λG, Oper. Res. Lett. 2 (1983) 211–215.
K. Sigman, A note on a sample-path rate conservation law and its relationship with H=λG, Department of Industrial Engineering and Operations Research, Columbia University (1990).
S. Stidham, Jr.,Static Decision Models for Queueing Systems with Non-Linear Waiting Costs, Ph.D. dissertation and Tech. Rept. 9, Department of Operations Research, Stanford University (1968).
S. Stidham, Jr., On the optimality of the single-server queueing system, Oper. Res. 18 (1970) 708–732.
S. Stidham, Jr.,L=λW: a discounted analogue and a new proof, Oper. Res. 20 (1972) 1115–1126.
S. Stidham, Jr., Regenerative processes in the theory of queues, with applications to the alternating-priority queue, Adv. Appl. Prob. 4 (1972) 542–577.
S. Stidham, Jr., A last word onL=λW, Oper. Res. 22 (1974) 417–421.
S. Stidham, Jr., On the relation between time averages and customer averages in stationary random marked point processes, Technical Report 79-1, Department of Industrial Engineering, North Carolina State University (1979).
S. Stidham, Jr., Sample-path analysis of queues, in:Applied Probability -Computer Science: The Interface, vol. 2, eds. R.L. Disney and T.J. Ott (Birkhäuser, Boston, 1982) pp. 41–70.
S. Stidham, Jr., On the relation between time averages and customer averages in queues, in:Variational Methods and Stochastic Analysis, eds. H.-J. Kimn and D.M. Chung,Proc. Workshop in Pure Mathematics 9 (1990) pp. 243–278.
S. Stidham, Jr. and M. El-Taha, Sample-path analysis of processes with imbedded point processes, Queueing Systems 5 (1989) 131–166.
J. Walrand,An Introduction to Queueing Networks (Prentice Hall, Englewood Cliffs, NJ, 1988).
R.W. Wolff, Poisson arrivals see time averages, Oper. Res. 30 (1982) 232–233.
R.W. Wolff, Sample-path derivations of the excess, age and spread distributions, J. Appl. Prob. 25 (1988) 432–436.
R.W. Wolff,Stochastic Modeling and the Theory of Queues (Prentice-Hall, Englewood Cliffs, NJ, 1989).
M.A. Zazanis, Sample path analysis of level crossings for the workload process, Department of Industrial Engineering and Management Sciences, Northwestern University.
Author information
Authors and Affiliations
Additional information
This paper is dedicated to the memory of our colleague Professor Peter Franken (1937–1989), who contributed greatly to the subject of this paper and to queueing theory more generally.
Rights and permissions
About this article
Cite this article
Whitt, W. A review ofL=λW and extensions. Queueing Syst 9, 235–268 (1991). https://doi.org/10.1007/BF01158466
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01158466