A study on some infinite server queues in discrete-time
Keyword(s):
This work analysis some discrete-time queueing mechanisms with infinitely many servers.By using a shot noise process, general results on the system size in discrete-time are given both in transient state and in steady state. For this we use the classical differentiation formula of F´a di Bruno. First two moments of the system size and distribution of the busy period of the system are also computed.
Keyword(s):
1990 ◽
Vol 27
(03)
◽
pp. 671-683
◽
Keyword(s):
2016 ◽
Vol 28
(5)
◽
pp. 702-706
◽
Keyword(s):
2006 ◽
Vol 23
(02)
◽
pp. 247-271
◽
Keyword(s):
Keyword(s):
2017 ◽
Vol 11
(8)
◽
pp. 619
◽
Keyword(s):
1986 ◽
1991 ◽
Vol 194
(1)
◽
pp. 253-258
◽
Keyword(s):