A M/M/1 Queueing Network with Classical Retrial Policy
2021 ◽
Vol 12
(1S)
◽
pp. 329-337
Keyword(s):
In this paper we study the M/M/1 queueing model with retrial on network. We derive the steady state probability of customers in the network, the average number of customers in the all the three nodes in the system, the queue length, system length using little’s formula. The particular case is derived (no retrial). The numerical examples are given to test the correctness of the model.
1995 ◽
Vol 8
(2)
◽
pp. 151-176
◽
1979 ◽
Vol 11
(01)
◽
pp. 240-255
◽
2011 ◽
Vol 235
(8)
◽
pp. 2242-2251
◽