The analysis of a finite-buffer general input queue with batch arrival and exponential multiple vacations

Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-buffer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals, i.e. we consider a batch arrival single-server queue with renewal input and multiple exponential vacations. Using the imbedded Markov chain and supplementary variable techniques we obtain steady-state distribution of number of customers in the system at pre-arrival and arbitrary epochs. The Laplace-Stieltjes transforms of the actual waiting-time distribution of the first-, arbitrary- and last-customer of a batch under First-Come-First-Serve discipline have been derived. Finally, we present useful performance measures of interest such as probability of blocking, average queue (system) length. Some tables and graphs showing the effect of model parameters on key performance measures are presented.

[1]  Winfried K. Grassmann,et al.  Regenerative Analysis and Steady State Distributions for Markov Chains , 1985, Oper. Res..

[2]  Dong Hwan Han,et al.  G/M^ /1 QUEUES WITH SERVER VACATIONS , 1994 .

[3]  Kyung C. Chae,et al.  On stochastic decomposition in the GI/M/1 queue with single exponential vacation , 2006, Oper. Res. Lett..

[4]  Yoshitaka Takahashi,et al.  An MX/GI/1/N queue with close-down and vacation times , 1999 .

[5]  Zhisheng Niu,et al.  A vacation queue with setup and close-down times and batch Markovian arrival processes , 2003, Perform. Evaluation.

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

[7]  C. D. Litton,et al.  A First Course in Bulk Queues , 1983 .

[8]  U. C. Gupta,et al.  Computing queue length distributions in MAP/G/1/N queue under single and multiple vacation , 2006, Appl. Math. Comput..

[9]  Surendra M. Gupta,et al.  The Finite Capacity GI/M/1 Queue with Server Vacations , 1996 .

[10]  Chengxuan Cao,et al.  The GI/M/1 queue with exponential vacations , 1989, Queueing Syst. Theory Appl..

[11]  Zhisheng Niu,et al.  A finite‐capacity queue with exhaustive vacation/close‐down/setup times and Markovian arrival processes , 1999, Queueing Syst. Theory Appl..

[12]  S. P. Mukherjee,et al.  GI/M/1 Queue with Server Vacations , 1990 .

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

[14]  Yutaka Takahashi,et al.  Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8 , 1993 .

[15]  U. C. Gupta,et al.  The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multiple vacations , 2005 .

[16]  David Frankel,et al.  brief review: Queueing Analysis: A Foundation of Performance Evaluation. Volume 1: Vacation and Priority Systems, Part 1 by H. Takagi (North-Holland, 1991) , 1991, PERV.

[17]  Kyung C. Chae,et al.  Busy period analysis for the GI/M/1 queue with exponential vacations , 2007, Oper. Res. Lett..

[18]  C. Blondia WITH NON-RENEWAL INPUT , 1991 .

[19]  M. L. Chaudhry,et al.  A first course in bulk queues , 1983 .

[20]  K. Sikdar,et al.  A finite capacity bulk service queue with single vacation and Markovian arrival process , 2004 .

[21]  Yoshitaka Takahashi,et al.  A note on an M/GI/1/N queue with vacation time and exhaustive service discipline , 1997, Oper. Res. Lett..

[22]  Tony T. Lee,et al.  M/G/1/N Queue with Vacation Time and Exhaustive Service Discipline , 1984, Oper. Res..