A review ofL=λW and extensions

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.

[1]  Howard Eves,et al.  An Introduction To The Foundations And Fundamental Concepts Of Mathematics , 1965 .

[2]  Shaler Stidham,et al.  L = λW: A Discounted Analogue and a New Proof , 1972, Oper. Res..

[3]  M. Miyazawa A formal approach to queueing processes in the steady state and their applications , 1979 .

[4]  S. Brumelle On the relation between customer and time averages in queues , 1971 .

[5]  Gordon F. Newell,et al.  Applications of queueing theory , 1971 .

[6]  Volker Schmidt,et al.  EPSTA: The coincidence of time-stationary and customer-stationary distributions , 1989, Queueing Syst. Theory Appl..

[7]  S. Stidham Regenerative processes in the theory of queues, with applications to the alternating-priority queue , 1972, Advances in Applied Probability.

[8]  Masakiyo Miyazawa Time and customer processes in queues with stationary inputs , 1977 .

[9]  Peter Franken,et al.  Einige Anwendungen der Theorie zufälliger Punktprozesse in der Bedienungstheorie I , 1975 .

[10]  R. Luchsinger,et al.  Zentrale Hörstörungen mit Paramusie nach Contusio cerebri , 1947 .

[11]  Edward D. Lazowska,et al.  Quantitative system performance - computer system analysis using queueing network models , 1983, Int. CMG Conference.

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

[13]  James McKenna,et al.  A generalization of little's law to moments of queue lengths and waiting times in closed, product-form queueing networks , 1988, Journal of Applied Probability.

[14]  Ward Whitt,et al.  On Arrivals That See Time Averages , 1990, Oper. Res..

[15]  Kai Lai Chung,et al.  A Course in Probability Theory , 1949 .

[16]  Ward Whitt,et al.  An extremal property of the fifo discipline via an ordinal version of , 1989 .

[17]  V. Schmidt,et al.  Queues and Point Processes , 1983 .

[18]  Shaler Stidham,et al.  On the Optimality of Single-Server Queuing Systems , 1970, Oper. Res..

[19]  P. H. Brill,et al.  The System Point Method in Exponential Queues: A Level Crossing Approach , 1981, Math. Oper. Res..

[20]  Pierre Brémaud,et al.  Characteristics of queueing systems observed at events and the connection between stochastic intensity and palm probability , 1989, Queueing Syst. Theory Appl..

[21]  Jacob Cohen,et al.  On up- and downcrossings , 1977, Journal of Applied Probability.

[22]  Alan Cobham,et al.  Priority Assignment in Waiting Line Problems , 1954, Oper. Res..

[23]  M. T. Cochito,et al.  A Survey of J. Little's Formula , 1983 .

[24]  Shelby Brumelle,et al.  A Generalization of L = λW to Moments of Queue Length and Waiting Times , 1972, Oper. Res..

[25]  D. König,et al.  Imbedded and non-imbedded stationary characteristics of queueing systems with varying service rate and point processes , 1980 .

[26]  Ward Whitt,et al.  A central-limit-theorem version ofL=λw , 1986, Queueing Syst. Theory Appl..

[27]  J. Ben Atkinson,et al.  An Introduction to Queueing Networks , 1988 .

[28]  P. H. Brill,et al.  Level Crossings in Point Processes Applied to Queues: Single-Server Case , 1977, Oper. Res..

[29]  Ward Whitt,et al.  Ordinary CLT and WLLN Versions of L = λW , 1988, Math. Oper. Res..

[30]  Ward Whitt,et al.  Sufficient conditions for functional-limit-theorem versions ofL = λW , 1987, Queueing Syst. Theory Appl..

[31]  Ronald W. Wolff,et al.  Poisson Arrivals See Time Averages , 1982, Oper. Res..

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

[33]  P. Franken,et al.  Queues and Point Processes , 1983 .

[34]  M. Miyazawa The derivation of invariance relations in complex queueing systems with stationary inputs , 1983 .

[35]  Ward Whitt,et al.  Indirect Estimation Via L = λW , 1989, Oper. Res..

[36]  Philip M. Morse,et al.  Queues, Inventories, And Maintenance , 1958 .

[37]  William S. Jewell,et al.  A Simple Proof of: L = λW , 1967, Oper. Res..

[38]  Guy Pujolle,et al.  Introduction to queueing networks , 1987 .

[39]  Muhammad El-Taha,et al.  Sample-path analysis of processes with imbedded point processes , 1989, Queueing Syst. Theory Appl..

[40]  Tomasz Rolski,et al.  Stationary Random Processes Associated with Point Processes , 1981 .

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

[42]  P. Brémaud,et al.  An elementary proof of Sengupta's invariance relation and a remark on Miyazawa's conservation principle , 1991, Journal of Applied Probability.

[43]  Edward D. Lazowska,et al.  Quantitative System Performance , 1985, Int. CMG Conference.

[44]  M. Miyazawa The intensity conservation law for queues with randomly changed service rate , 1985, Journal of Applied Probability.

[45]  Ronald W. Wolff Sample-path derivations of the excess, age, and spread distributions , 1988 .

[46]  Ward Whitt,et al.  An LIL Version of L = λW , 1988, Math. Oper. Res..

[47]  Ward Whitt,et al.  The Asymptotic Efficiency of Simulation Estimators , 1992, Oper. Res..

[48]  Samuel Eilon,et al.  Letter to the Editor - A Simpler Proof of L = λW , 1969, Oper. Res..

[49]  Ward Whitt,et al.  Estimating Average Production Intervals Using Inventory Measurements: Little's Law for Partially Observable Processes , 1988, Oper. Res..

[50]  William L. Maxwell,et al.  Letter to the Editor - On the Generality of the Equation L = λW , 1970, Oper. Res..

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

[52]  S. O. Rice Single server systems — I. Relations between some averages , 1962 .

[53]  Aurel A. Lazar,et al.  RATE CONSERVATION FOR STATIONARY PROCESSES , 1991 .

[54]  Ward Whitt,et al.  Extensions of the Queueing Relations L = λW and H = λG , 1989, Oper. Res..

[55]  Shaler Stidham,et al.  The Relation between Customer and Time Averages in Queues , 1980, Oper. Res..

[56]  Catherine Rosenberg,et al.  On rate conservation for non-stationary processes , 1991 .

[57]  C. de Montmollin,et al.  Contribution à l’étude de la tuberculose trachéo·bronchique , 1945 .

[58]  Michael A. Zazanis,et al.  Sample path analysis of level crossings for the workload process , 1992, Queueing Syst. Theory Appl..

[59]  Ronald W. Wolff,et al.  Stochastic Modeling and the Theory of Queues , 1989 .

[60]  Gabriel R. Bitran,et al.  Hierarchical Production Planning: A Two-Stage System , 1982, Oper. Res..

[61]  G. F. Newell,et al.  A relation between stationary queue and waiting time distributions , 1971, Journal of Applied Probability.

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

[63]  Averill M. Law Efficient estimators for simulated queueing systems , 1974 .

[64]  Peter J. Denning,et al.  The Operational Analysis of Queueing Network Models , 1978, CSUR.