The Theory of Queues
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.
KeywordsService Time Busy Period Probability Generate Function Idle Period Service Time Distribution
Unable to display preview. Download preview PDF.
- Cooper, RobertB. (1972), Introduction to Queueing Theory, Macmillan, New York.Google Scholar
- Cox, D. R. and Smith, Walter L. (1961), Queues, John Wiley and Sons, New York.Google Scholar
- Kleinrock, Leonard (1975), Queueing Systems, Vol. 1: Theory, John Wiley and Sons, New York.Google Scholar
- Newell, Gordon (1971), Applications of Queueing Theory, Chapman and Hall, London.Google Scholar
- Takacs, Lmos, (1962), Introduction to the Theory of Queues, Oxford University, New York.Google Scholar
- Takacs, Lajos, (1967), Combinatorial Method in the Theory of Stochastic Processes, John Wiley and Sons, New York.Google Scholar