Skip to main content
Log in

Little’s law when the average waiting time is infinite

  • Original Paper
  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

One version of Little’s law, written as \(L = \lambda w\), is a relation between averages along a sample path. There are two others in a stochastic setting; they readily extend to the case where the average waiting time \(w\) is infinite. We investigate conditions for the sample-path version of this case to hold. Published proofs assume (our) Eq. (3) holds. It is only sufficient. We present examples of what may happen when (3) does not hold, including one that may be new where \(w\) is infinite and \(L\) is finite. We obtain a sufficient condition called “weakly FIFO” that is weaker than (3), and through truncation, a necessary and sufficient condition. We show that (3) is sufficient but not necessary for the departure rate to be equal to the arrival rate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Breiman, L.: Probability. Addison Wesley, Reading (1968)

  2. Brumelle, S.: On the relation between customer and time averages in queues. J. Appl. Probab. 8, 508–520 (1971)

    Article  Google Scholar 

  3. El-Taha, M., Stidham Jr, S.: Sample-Path Analysis of Queueing Systems. Kluwer Academic Publishers, Boston (1999)

    Book  Google Scholar 

  4. Franken, P., König, D., Arndt, U., Schmidt, V.: Queues and Point Processes. Wiley, New York (1982)

    Google Scholar 

  5. Little, J.D.C.: A proof of the queuing formula: \(L = \lambda W\). Oper. Res. 9, 383–387 (1961)

    Article  Google Scholar 

  6. Little, J.D.C.: Little’s law as viewed on its 50th anniversary. Oper. Res. 59, 536–549 (2011)

    Article  Google Scholar 

  7. Little, J.D.C., Wolff, R.W.: The “Flaw” in Little (1961), its Identification and Fixes. Online commentary on the INFORMS web site. http://orforum.blog.informs.org/ (2011)

  8. Loève, M.: Probability Theory, 3rd edn. Van Nostrand, Princeton (1963)

    Google Scholar 

  9. Serfozo, R.F.: Little laws for utility processes and waiting times in queues. Queueing Syst. 17, 137–181 (1994)

    Article  Google Scholar 

  10. Sigman, K.: Notes on Little’s law. www.columbia.edu/ks20/stochastic-I/stochastic-I-LL.pdf (2009)

  11. Stidham Jr, S.: A last word on \(L = \lambda W\). Oper. Res. 22, 417–421 (1974)

    Article  Google Scholar 

  12. Whitt, W.: A review of \(L = \lambda W\) and extensions. Queueing Syst. 9, 235–268 (1991)

    Article  Google Scholar 

  13. Wolff, R.W.: Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs (1989)

    Google Scholar 

  14. Wolff, R.W.: Little’s law and related results. In: Cochran, J.J. (ed.) Wiley Encyclopedia of Operations Research and Management Science, vol. 4, pp. 2828–2841. Wiley, Hoboken (2011)

    Google Scholar 

Download references

Acknowledgments

We are grateful to Karl Sigman for many comments on this manuscript, and in particular, for contributing the proof of (17), and to Rhonda Righter, whose comments helped us improve the exposition.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ronald W. Wolff.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wolff, R.W., Yao, YC. Little’s law when the average waiting time is infinite. Queueing Syst 76, 267–281 (2014). https://doi.org/10.1007/s11134-013-9364-8

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11134-013-9364-8

Keywords

Mathematics Subject Classification

Navigation