Article contents
The busy period of the Ek/G/1 queue by finite waiting room
Published online by Cambridge University Press: 01 July 2016
Abstract
For the Ek/G/1 queue with finite waiting room the phase technique is used to analyse the Markov chain imbedded in the queueing process at successive instants at which customers complete service, and the distribution of the busy period, together with the number of customers who arrive, and the number of customers served, during that period, is obtained. The limit as the size of the waiting room becomes infinite is found.
- Type
- Research Article
- Information
- Copyright
- Copyright © Applied Probability Trust 1975
References
- 3
- Cited by