Article contents
The departure process for the M/M/1 queue
Published online by Cambridge University Press: 14 July 2016
Abstract
The problem of determining the probability of j departures during the time interval (0, t) from an M/M/l queue empty at t = 0 is considered. A closed-form solution is obtained. It is shown that this solution is unique and invariant under interchanging the arrival rate and service rate. Finally, sample computational representations of the solution are developed and results of a simple computation are provided.
Keywords
- Type
- Short Communications
- Information
- Copyright
- Copyright © Applied Probability Trust 1986
References
- 7
- Cited by