MAP/G/1 QUEUES UNDER N-POLICY WITH AND WITHOUT VACATIONS

Abstract This paper considers MAP/G/1 queueing systems under the following two situations: (1) At the end of a busy period, the server is turned off and inspects the queue length every time a customer a,rrives. When the queue length reaches a pre-specified value N , the server turns on and serves customers continuously until the system becomes empty. (2) At the end of a busy period, the server takes a sequence of va.cations. At the end of ea,ch va.cation, the server inspects the queue length. If the queue length is greater than or equa,l to a pre-specified value N at this time, the server begins to serve customers continuously until the system becomes empty. For ea.ch case, we analyze the stationary queue length and the actual wa,iting time distributions, and derive the recursive formulas to compute the moments of these distributions. Furthermore, we provide a numerical algorithm to obtain the mass function of the stationary queue length. The numerical exa,mples show tl1a.t in light traffic, correlation in a,rrivals leads to a smaller mean waiting time.

[1]  Tetsuya Takine,et al.  On the relationship between queue lengths at a random instant and at a departure in the stationary queue with bmap arrivals , 1998 .

[2]  Mandyam M. Srinivasan,et al.  Control policies for the M X /g/ 1 queueing system , 1989 .

[3]  Robert B. Cooper,et al.  Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations , 1985, Oper. Res..

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

[5]  M. Neuts,et al.  A single-server queue with server vacations and a class of non-renewal arrival processes , 1990, Advances in Applied Probability.

[6]  Marcel F. Neuts,et al.  Structured Stochastic Matrices of M/G/1 Type and Their Applications , 1989 .

[7]  高木 英明,et al.  Vacation and priority systems , 1991 .

[8]  M. Neuts,et al.  A SINGLE-SERVER QUEUE WITH SERVER VACATIONS AND A CLASS OF NON-RENEWAL ARRIVAL PROCESSES , 1990 .

[9]  高木 英明.  Stochastic analysis of computer and communication systems , 1990 .

[10]  Tatsuya Suda,et al.  Mean Waiting Times in Nonpreemptive Priority Queues with Markovian Arrival and i.i.d. Service Processes , 1994, Perform. Evaluation.

[11]  Micha Hofri.  Queueing systems with a procrastinating server , 1986, SIGMETRICS '86/PERFORMANCE '86.

[12]  S. Asmussen,et al.  Marked point processes as limits of Markovian arrival streams , 1993 .

[13]  V. Ramaswami.  A stable recursion for the steady state vector in markov chains of m/g/1 type , 1988 .

[14]  Hideaki Takagi,et al.  Queueing analysis: a foundation of performance evaluation , 1993 .

[15]  Offer Kella.  The threshold policy in the M/G/1 queue with server vacations , 1989 .