Article contents
Combinatorial techniques for M/G/1-type queues
Published online by Cambridge University Press: 14 July 2016
Abstract
The application of the generalised ballot theorem to queueing theory leads to elegant results for the simple M/G/1 queue. It is thought that such results are not possible for more general M/G/1-type queues. We, however, derive a batch ballot theorem which can be applied to derive the first passage distribution matrix, G, for the general M/G/1-type queue.
MSC classification
- Type
- Research Papers
- Information
- Copyright
- Copyright © by the Applied Probability Trust 2001
References
- 2
- Cited by