论文信息 - Busy period analysis for the n-policy GI/M/c queue

Busy period analysis for the n-policy GI/M/c queue

Abstract We consider the busy period in the n -policy GI/M/c queue. We present a procedure to obtain the joint transform of the length of a busy period, the number of customers served during the busy period, and the remaining interarrival time at the instant the busy period ends.

K. Chae | Dae-Eun Lim | Kyung C. Chae | Dae Eun Lim

[1] Stig. I. Rosenlund,et al. The queue G/M/m/N: Busy period and cycle, waiting time under reverse and random order service , 1978 .

[2] M. J. Lopez-Herrero,et al. Analysis of the busy period for the M/M/c queue: an algorithmic approach , 2001, Journal of Applied Probability.

[3] D. Daley,et al. Idle and busy periods in stable M/M/k queues , 1998, Journal of Applied Probability.

[4] Vincent Hodgson,et al. The Single Server Queue. , 1972 .

[5] Naishuo Tian,et al. The N threshold policy for the GI/M/1 queue , 2004, Oper. Res. Lett..

[6] De Smit,et al. On the many server queue with exponential service times , 1973 .