References

Abramov, V.M., 1997. On a property of a refusals stream. J. Applied Probab., 34: 800-805.
Direct Link  |  

Casella, G. and R.L. Berger, 1976. On the relationship between the distribution of maximal queue length in the M/G/1 queue and the mean busy period in the M/G/1/n queue. J. Applied Probab., 13: 195-199.

Casella, G. and R.L. Berger, 2002. Statistical Inference. 2nd Edn., Thomson Learning, UK., ISBN: 9780534243128, Pages: 660.

Conway, R.W., W.L. Maxwell and L.W. Miller, 1967. Theory of Scheduling. Addison-Wesley Pub. Co., New York, Pages: 294.

German, R., 2000. Performance Analysis of Communication Systems: Modeling with Non-Markovian Stochastic Petri Nets. 1st Edn., Willy, Chichester, UK., ISBN: 978-0471492580, Pages: 456.

Harris, T.J., 1971. The remaining busy period of a finite queue. Oper. Res., 19: 219-223.

Kulkarni, V.G., 1995. Modeling and Analysis of Stochastic Systems. Chapman and Hall, London,‎.

Kwiatkowska, M., G. Norman and A. Pacheco, 2002. Model Checking CSL Until ‎‎‎Formulae with Random Time Bounds. In: Process Algebra and Probabilistic Methods Performance Modeling and Verification, Herman, H. and R. Segala (Eds.). Springer Verlag, New York, USA.

Miller, L.W., 1975. A note on the busy period of an M/G/1 finite queue. Operations Res., 23: 1179-1182.

Pacheco, A. and H. Riberio, 2008. Moments of the duration of busy periods of systems. Probability Eng. Inf. Sci., 22: 347-354.
CrossRef  |  

Perry, D., W. Stadje and S. Zacks, 2000. Busy period analysis for M/G/1 and G/M/1 type queues with restricted accessibility. Oper. Res. Lett., 27: 163-174.
CrossRef  |  

Righter, R., 1999. A note onl osses in M=GI=1=n queues. J. Applied Probab., 36: 1240-1243.

Stuck, B.W. and E. Arthurs, 1985. A Computer and Communications Network Performance Primer.. Prentice-Hall, New Jersey, USA.

Vijaya Laxmi, P. and U.C. Gupta, 2000. Analysis of finite-buffer multi-server queues with group arrivals: GI^X/M/c/N. Queueing Syst., 36: 125-140.
CrossRef  |  Direct Link  |