## Abstract

In this chapter we analyze a simple single server queue that is frequently used to model components of computer systems. This queue is termed the which have the following interpretation:

*M/G/1*queue. This is standard “queueing notation,” first introduced by Kendall. Typically a queue is described by four variables$$
A/S/k/c,
$$

A,S — The arrival (A) or service (S) process where M means Poisson arrivals and exponential service times, G means the process is generally distributed, *E* _{ ℓ } denotes an *ℓ*-stage Erlang distribution, and D denotes a deterministic distribution.

*k* — The number of servers.

*c* — The buffer size of the system. This is the total number of customers the system can hold. Arrivals to the system already containing *c* customers are assumed to be lost. If not specified, *c* is assumed to be infinite.

## Keywords

Service Time Queue Length Busy Period Probability Generate Function Poisson Arrival
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.

## Preview

Unable to display preview. Download preview PDF.

## Bibliographic Notes

- [6]V. E. Bene§.
*General Stochastic Processes in the Theory of Queues*. Addison-Wesley, 1963.Google Scholar - [21]R.B. Cooper.
*Introduction to Queuing Theory*. Macmillan, 2nd edition, 1972.Google Scholar - [24]D.R. Cox and W.L. Smith.
*Queues*. Methunen, 1961.Google Scholar - [43]R.L. Graham, D.E. Knuth, and O. Patashnik.
*Concrete Mathematics*. Addison-Wesley, 1989.Google Scholar - [65]
- [70]H. Kobayashi.
*Modeling and Analysis - An Introduction to System Performance Evaluation Methodology*. Addison-Wesley, 1978.Google Scholar - [76]S.S. Lavenberg.
*Computer Performance Modeling Handbook*. Academic Press, 1983.Google Scholar - [80]J.D.C. Little. A simple proof of
*1 =.w. Operations Research*, 9: 383–387, 1961.MathSciNetzbMATHCrossRefGoogle Scholar - [6]V. E. Bene§.
*General Stochastic Processes in the Theory of Queues*. Addison-Wesley, 1963.Google Scholar - [19]J.W. Cohen.
*The Single Server Queue*. North-Holland, 2nd edition, 1969.Google Scholar - [21]R.B. Cooper.
*Introduction to Queuing Theory*. Macmillan, 2nd edition, 1972.Google Scholar - [102]T.L. Saaty.
*Elements of Queueing Theory*. McGraw-Hill, 1961.Google Scholar - [112]L. Takâcs.
*Introduction to the Theory of Queues*. Oxford University Press, 1962.Google Scholar - [118]K.S. Trivedi.
*Probability and Statistics with Reliability*,*Queuing*,*and Computer Science Applications*. Prentice Hall, 1982.Google Scholar - [122]W. Whitt. A review of
*1 = Mw*and extensions.*Queueing Syst. Theory Appl*., 9 (3): 5–68, 1991.CrossRefGoogle Scholar - [125]R. W. Wolff.
*Stochastic Modeling and the Theory of Queues*. Prentice Hall, 1989.Google Scholar - [126]R.W. Wolff. Poisson arrivals see time averages.
*Operations Research*, 223–231, 1982.Google Scholar

## Copyright information

© Springer Science+Business Media New York 1995