The Theory of Queues

  • Frank A. Haight
Part of the Mathematical Concepts and Methods in Science and Engineering book series (MCSENG, volume 23)


Queueing theory is a generic term for mathematical structures inspired by and descriptive of service systems with random features such as random delay, randomly arriving customers, etc. Such systems can be classified in two ways: according to the structure and postulates which characterize the operation, on the one hand, and according to the random variable of interest, on the other. Table 6.1. with some of the important random variables, together with associated notation, is given on p. 228.


Service Time Busy Period Probability Generate Function Idle Period Service Time Distribution 
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.


  1. Cooper, RobertB. (1972), Introduction to Queueing Theory, Macmillan, New York.Google Scholar
  2. Cox, D. R. and Smith, Walter L. (1961), Queues, John Wiley and Sons, New York.Google Scholar
  3. Kleinrock, Leonard (1975), Queueing Systems, Vol. 1: Theory, John Wiley and Sons, New York.Google Scholar
  4. Newell, Gordon (1971), Applications of Queueing Theory, Chapman and Hall, London.Google Scholar
  5. Takacs, Lmos, (1962), Introduction to the Theory of Queues, Oxford University, New York.Google Scholar
  6. Takacs, Lajos, (1967), Combinatorial Method in the Theory of Stochastic Processes, John Wiley and Sons, New York.Google Scholar

Copyright information

© Plenum Press, New York 1981

Authors and Affiliations

  • Frank A. Haight
    • 1
  1. 1.The Pennsylvania State UniversityPennsylvaniaUSA

Personalised recommendations