A note on a D/G/K loss system with retrials
Keyword(s):
System A
◽
An algorithm is suggested for approximating the performance of a D/G/K loss system with deterministic input, generally distributed processing time, K heterogeneous servers, the random access processing discipline, and retrials in steady state. In loss systems with retrials, the units which at the instants of their arrival at the system find all the servers busy, are not lost: those units retry to be processed by merging with the incoming arrival units. In this system, a fraction of the units which have not initially been processed will be allowed to leave the system. The performance of this system in steady state is approximated by a recursive technique.
1986 ◽
Vol 23
(01)
◽
pp. 236-242
◽
1998 ◽
Vol 30
(1)
◽
pp. 152-166
◽
1998 ◽
Vol 30
(01)
◽
pp. 152-166
◽
2013 ◽
Vol 45
(01)
◽
pp. 274-294
◽
2013 ◽
Vol 45
(1)
◽
pp. 274-294
◽
2014 ◽
Vol 14
(04)
◽
pp. 1450009
◽
2003 ◽
Vol 81
(8)
◽
pp. 765-773
◽
1981 ◽
Vol 18
(03)
◽
pp. 776-781
◽
Keyword(s):