Encyclopedia of Operations Research and Management Science

2013 Edition
| Editors: Saul I. Gass, Michael C. Fu

Queueing Theory

  • Daniel P. Heyman
Reference work entry
DOI: https://doi.org/10.1007/978-1-4419-1153-7_847

Introduction

Queueing theory is the study of service systems with substantial statistical fluctuations in either the arrival or service rates. Other names for the subject are stochastic service systems and the theory of mass storage. An example of a stochastic service system from everyday life is a line for bank tellers (human or machine); customers arrive at random, and the transaction lengths will vary depending on the services requested. An example from the world of technology is a computer system; jobs arrive randomly and require different amounts of system resources. An all-too-common source of service-rate variability is a hardware or software crash, which probably occurs randomly even though it might appear that they happen just when you want to use the computer. Looking inside the computer system reveals some more stochastic-service systems. The components (e.g., disk drives, I/O devices, the CPU) have randomly arriving tasks, and the time required to execute a task may be...

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

References

  1. Abate, J., & Whitt, W. (1992). The Fourier-series method for inverting transforms of probability distributions. Queueing Systems, 10, 5–88.CrossRefGoogle Scholar
  2. Cohen, J. W. (1969). The Single Server Queue. New York: Wiley.Google Scholar
  3. Cooper, R. B. (1984). Introduction to Queueing Theory (2nd ed.). New York: North-Holland.Google Scholar
  4. Cox, D. R., & Smith, W. L. (1961). Queues. London: Methuen.Google Scholar
  5. Gross, D., Shortle, J. F., Thompson, J. M., & Harris, C. M. (2008). Fundamentals of Queueing Theory (4th ed.). New York: Wiley.CrossRefGoogle Scholar
  6. Heyman, D. P., & Sobel, M. J. (1982). Stochastic Models in Operations Research (Vol. 1). New York: McGraw-Hill.Google Scholar
  7. Kelly, F. P. (1979). Reversibility and Stochastic Networks. New York: Wiley.Google Scholar
  8. Kendall, D. G. (1953). Stochastic processes occurring in the theory of queues and their analysis by the method of the imbedded Markov chain. Annals of Mathematical Statistics, 24(3), 338–354.CrossRefGoogle Scholar
  9. Kleinrock, L. (1975). Queueing Systems (Vol. 1 and 2). New York: Wiley.Google Scholar
  10. Lindley, D. V. (1952). The theory of queues with a single server. Mathematical Proceedings of the Cambridge Philosophical Society, 48(2), 277–289.CrossRefGoogle Scholar
  11. Morse, P. M. (1958). Queues, Inventories and Maintenance. New York: Wiley.Google Scholar
  12. Neuts, M. F. (1981). Matrix-Geometric Solutions in Stochastic Models. Baltimore: Johns Hopkins University Press.Google Scholar
  13. Prabhu, N. U. (1965). Queues and Inventories. New York: Wiley.Google Scholar
  14. Stewart, W. J. (1994). Introduction to the Numerical Solution of Markov Chains. Princeton: Princeton University Press.Google Scholar
  15. Stidham, S., Jr. (2009). Optimal Design of Queueing Systems. New York: Chapman and Hall.CrossRefGoogle Scholar
  16. Takács, L. (1962). Introduction to the Theory of Queues. New York: Oxford University Press.Google Scholar
  17. Walrand, J. (1988). An Introduction to Queueing Networks. Englewood Cliffs: Prentice Hall.Google Scholar
  18. Wolff, R. W. (1989). Stochastic Modeling and the Theory of Queues. Englewood Cliffs: Prentice Hall.Google Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.LincroftUSA