The departure process for the M/M/1 queue
Keyword(s):
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.
1986 ◽
Vol 23
(01)
◽
pp. 249-255
◽
2013 ◽
Vol 40
(2)
◽
pp. 106-114
2000 ◽
Vol 19
(4)
◽
pp. 278-291
◽
Keyword(s):
Keyword(s):
2021 ◽
pp. 1-10