Cyclic queueing networks with subexponential service times
2004 ◽
Vol 41
(3)
◽
pp. 791-801
◽
Keyword(s):
For a K-stage cyclic queueing network with N customers and general service times, we provide bounds on the nth departure time from each stage. Furthermore, we analyze the asymptotic tail behavior of cycle times and waiting times given that at least one service-time distribution is subexponential.
Keyword(s):
2014 ◽
Vol 226
(1)
◽
pp. 417-441
◽
1995 ◽
Vol 33
(3)
◽
pp. 695-703
◽
Keyword(s):
1984 ◽
Vol 16
(01)
◽
pp. 216-219
◽
Keyword(s):
1990 ◽
Vol 46
(1)
◽
pp. 123-135
◽
Keyword(s):
2017 ◽
Vol 54
(4)
◽
pp. 995-1007
◽
Keyword(s):