No CrossRef data available.
Article contents
On the busy period of discrete-time queues
Published online by Cambridge University Press: 14 July 2016
Abstract
This paper obtains the probability and the expectation of the length of the busy and idle periods in a discrete-time service system by means of two-component Markov chains and their first passage times. The M/G/1 model is discussed as a special case.
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1974