1 |
Cooper, R.B. and Tilt, B., 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, Journal of Applied Probability, 1976, Vol. 13, No. 1, pp. 195-199.
DOI
|
2 |
Ferreira, F., Pacheco, A., and Ribeiro, H., Moments of losses during busy-periods of regular and nonpreemptive oscillating MX/G/1/n systems, Annals of Operations Research, 2017, Vol. 252, No. 1, pp. 191211.
|
3 |
Gravey, A. and Hebuterne, G., Simultaneity in discretetime single server queues with Bernoulli inputs, Performance Evaluation, 1992, Vol. 14, No. 2, pp. 123-131.
DOI
|
4 |
Harchol-Balter, M., Performance modeling and design of computer systems : Queueing theory in action, Cambridge University Press, 2013.
|
5 |
Harris, T.J., The remaining busy period of a finite queue, Operations Research, 1971, Vol. 19, No. 1, pp. 219-223.
DOI
|
6 |
Kim, K., (N, n)-preemptive repeat-different priority queues, Journal of Society of Korea Industrial and Systems Engineering, 2017, Vol. 40, No. 3, pp. 66-75.
DOI
|
7 |
Kim, K., The analysis of an opportunistic spectrum access with a strict t-preemptive priority discipline, Journal of Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 4, pp. 162-170.
DOI
|
8 |
Lee, T.T., M/G/1/N queue with vacation time and exhaustive service discipline, Operations Research, 1984, Vol. 32, No. 4, pp. 774-784.
DOI
|
9 |
Miller, L.W., A note on the busy period of an M/G/1 finite queue, Operations Research, 1975, Vol. 23, No. 6, pp. 1179-1182.
DOI
|
10 |
Pacheco, A. and Ribeiro, H., Moments of the duration of busy periods of Mx/G/1/N systems, Probability in the Engineering and Informational Sciences, 2008, Vol. 22, No. 3, pp. 347-354.
DOI
|
11 |
Shanthikumar, J.G. and Sumita, U., On the busy-period distributions of M/G/1/K queues by state-dependent arrivals and FCFS/LCFS-p service disciplines, Journal of Applied Probability, 1985, Vol. 22, No. 4, pp. 912-919.
DOI
|
12 |
Takagi, H. and Tarabia, A.M., Explicit probability density function for the length of a busy period in an M/M/1/K queue, Advances in queueing theory and network applications, Springer, pp. 213-226.
|
13 |
Takagi, H., Queueing analysis, Volume 1 : Vacation and priority systems, part 1, North-Holland, 1991.
|
14 |
Takagi, H., Queueing analysis, Volume 3 : Discrete-time systems, North-Holland, 1993.
|
15 |
Wilf, H.S., Generating functionology, AK Peters/CRC Press, 2005.
|
16 |
Yu, M. and Alfa, A.S., A simple method to obtain the stochastic decomposition structure of the busy period in Geo/Geo/1/N vacation queue, 4OR, 2015, Vol. 13, No. 4, pp. 361380.
|
17 |
Al Hanbali, A. and Boxma, O., Busy period analysis of the state dependent M/M/1/K queue, Operations Research Letters, 2010, Vol. 38, No. 1, pp. 1-6.
DOI
|
18 |
Al Hanbali, A., Busy period analysis of the level dependent PH/PH/1/K queue, Queueing Systems, 2011, Vol. 67, No. 3, pp. 221-249.
DOI
|
19 |
Bruneel, H. and Kim, B.G., Discrete-time models for communication systems including ATM, Kluwer Academic Publishers, 1993.
|
20 |
Chaudhry, M.L. and Zhao, Y.Q., First-passage-time and busy-period distributions of discrete-time Markovian queues : Geom (n)/Geom (n)/1/n, Queueing Systems, 1994, Vol. 18, No. 1-2, pp. 526.
|
21 |
Cohen, J.W. and Browne, A., The single server queue, North-Holland Amsterdam, 1982.
|