论文信息 - Transient behavior of coverage processes by applications to the infinite-server queue - 字舞流文

Transient behavior of coverage processes by applications to the infinite-server queue

J. Michael Steele | Sid Browne

[1] S. Ross,et al. SOME RESULTS FOR INFINITE SERVER POISSON QUEUES , 1969 .

[2] Wolfgang Stadje,et al. Coverage problems for random intervals , 1989 .

[3] Ward Whitt,et al. Ordinary CLT and WLLN Versions of L = λW , 1988, Math. Oper. Res..

[4] Julian Keilson,et al. The backlog and depletion-time process for M/G/1 vacation models with exhaustive service discipline , 1988, Journal of Applied Probability.

[5] D. N. Shanbhag,et al. On infinite server queues with batch arrivals , 1966 .

[6] J. Hammersley,et al. On a probability problem arising in the theory of counters , 1956, Mathematical Proceedings of the Cambridge Philosophical Society.

[7] Bounds for the variance of the busy period of the M/G/∞ queue , 1984, Advances in Applied Probability.

[8] W. Stadje. The busy period of the queueing system M / G /∞ , 1985 .

[9] Richard Cowan,et al. Objects arranged randomly in space: an accessible theory , 1989, Advances in Applied Probability.

[10] H. Solomon,et al. Some Results for Secondary Processes Generated by a Poisson Process. , 1974 .

[11] B. T. Doshi,et al. Queueing systems with vacations — A survey , 1986, Queueing Syst. Theory Appl..

[12] U. Yechiali,et al. Dynamic priority rules for cyclic-type queues , 1989, Advances in Applied Probability.