Introduction to Queueing Theory

Part of the The Kluwer International Series on Discrete Event Dynamic Systems book series (DEDS, volume 11)


A simple queueing system was first introduced in Chapter 1 as an example of a DES. We have since repeatedly used it to illustrate many of the ideas and techniques discussed thus far. In this chapter, we will take a more in-depth look at queueing systems.


Service Time Arrival Rate Queue Length Queueing System Interarrival Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Selected References

  1. Asmussen, S., Applied Probability and Queues, Wiley, New York, 1987.zbMATHGoogle Scholar
  2. Baskett, F., K. M. Chandy, R. R., Muntz, and R. R. Palacios, “Open, Closed, and Mixed Networks with Different Classes of Customers,” Journal of ACM, Vol. 22, No. 2, pp. 248–260, 1975.MathSciNetzbMATHCrossRefGoogle Scholar
  3. Bremaud, P., Point Processes and Queues, Springer-Verlag, 1981.Google Scholar
  4. Burke, P. J., “The Output of a Queueing System,” Operations Research, Vol. 4, pp. 699–704, 1956.MathSciNetCrossRefGoogle Scholar
  5. Buzen, J. P., “Computational Algorithms for Closed Queueing Networks with Exponential Servers,” Communications of ACM, Vol. 16, No. 9, pp. 527–531, 1973.MathSciNetzbMATHCrossRefGoogle Scholar
  6. Gordon, W. J., and R. R. Newell, “Closed Queueing Systems with Exponential Servers,” Operations Research, Vol. 15, No. 2, pp. 254–265, 1967.zbMATHCrossRefGoogle Scholar
  7. Jackson, J. R., “Jobshop-Like Queueing Systems,” Management Science, Vol. 10, No. 1, pp. 131–142, 1963.CrossRefGoogle Scholar
  8. Kleinrock, L., Queueing Systems, Volume I: Theory, Wiley, New York, 1975.Google Scholar
  9. Lindley, D. V., “The Theory of Queues with a Single Server,” Proceedings of Cambridge Philosophical Society, Vol. 48, pp. 277–289, 1952.MathSciNetCrossRefGoogle Scholar
  10. Little, J. D. C., “A Proof of L =)W, ” Operations Research, Vol. 9, No. 3, pp. 383–387, 1961.MathSciNetzbMATHCrossRefGoogle Scholar
  11. Reiser, M., and S. S. Lavenberg, “Mean-Value Analysis of Closed Multi-chain Queueing Networks,” Journal of ACM, Vol. 27, No. 2, pp. 313–322, 1980.MathSciNetzbMATHCrossRefGoogle Scholar
  12. Snowdon, J. L., and J. C. Ammons, “A Survey of Queueing Network Packages for the Analysis of Manufacturing Systems,” Manufacturing Review, Vol. 1, No. 1, pp. 14–25, 1988.Google Scholar
  13. Stidham, S., Jr., “A Last Word on L = ÀW, ” Operations Research, Vol. 22, pp. 417–421, 1974.MathSciNetzbMATHCrossRefGoogle Scholar
  14. Trivedi, K.S., Probability and Statistics with Reliability, Queuing and Computer Science Applications, Prentice-Hall, Englewood Cliffs, 1982.Google Scholar
  15. Walrand, J., An Introduction to Queueing Networks, Prentice-Hall, Englewood Cliffs, 1988.zbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  1. 1.Boston UniversityUSA
  2. 2.The University of MichiganUSA

Personalised recommendations