On a new formula for the transient state probabilities for M/M/1 queues and computational implications
Keyword(s):
Past work relating to the computation of time-dependent state probabilities in M/M/1 queueing systems is reviewed, with emphasis on methods that avoid Bessel functions. A new series formula of Sharma [13] is discussed and its connection with traditional Bessel function series is established. An alternative new series is developed which isolates the steady-state component for all values of traffic intensity and which turns out to be computationally superior. A brief comparison of our formula, Sharma's formula, and a classical Bessel function formula is given for the computation time of the probability that an initially empty system is empty at time t later.
1993 ◽
Vol 30
(01)
◽
pp. 237-246
◽
Keyword(s):
1963 ◽
Vol 59
(1)
◽
pp. 117-124
◽
1999 ◽
Vol 50
(8)
◽
pp. 777-788
◽
Keyword(s):
2014 ◽
Vol 12
(05)
◽
pp. 1461007
Keyword(s):
2011 ◽
Vol 66
(1-2)
◽
pp. 40-46
◽
1990 ◽
Vol 42
(5)
◽
pp. 933-948
◽
Keyword(s):
1918 ◽
Vol 94
(659)
◽
pp. 190-206
◽
Keyword(s):
2005 ◽
Vol 2005
(18)
◽
pp. 2863-2870
2019 ◽
Vol 38
(6)
◽
pp. 73-83