Abstract
We consider a batch arrival finite buffer single server queue with inter-batch arrival times are generally distributed and arrivals occur in batches of random size. The service process is correlated and its structure is presented through Markovian service process (MSP). The model is analyzed for two possible customer rejection strategies: partial batch rejection and total batch rejection policy. We obtain steady-state distribution at pre-arrival and arbitrary epochs along with some important performance measures, like probabilities of blocking the first, an arbitrary, and the last customer of a batch, average number of customers in the system, and the mean waiting times in the system. Some numerical results have been presented graphically to show the effect of model parameters on the performance measures. The model has potential application in the area of computer networks, telecommunication systems, manufacturing system design, etc.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Albores-Velasco FJ, Tajonar-Sanabria FS (2004) Analysis of the GI/MSP/c/r queueing system. Inf Process 4:46–57
Alfa AS, Qiang JX, Ye Q (2000) Perturbation theory for the asymptotic decay rates in the queues with Markovian arrival process and/or Markovian service process. Queueing Syst 36:287–301
Baba Y (1984) The M X/G/1 queue with finite waiting room. J Oper Res Soc Jpn 27:260–272
Bocharov PP (1996) Stationary distribution of a finite queue with recurrent flow and Markovian service. Autom Remote Control 57:66–78
Bocharov PP, D’Apice C, Pechinkin A, Salerno S (2003) The stationary characteristics of the G/MSP/1/r queueing system. Autom Remote Control 64:288–301
Chakravarthy S (1993) Analysis of a finite MAP/G/1 queue with group services. Queueing Syst 13:385–407
Choi BD, Hwang GU, Han DH (1998) Supplementary variable method applied to the MAP/G/1 queueing system. J Aust Math Soc B 40:86–96
Ferrandiz JM (1993) The BMAP/G/1 queue with server set-up times and server vacations. Adv Appl Probab 25:235–254
Grassmann WK, Taksar MI, Heyman DP (1985) Regenerative analysis and steady state distributions for Markov chains. Oper Res 33:1107–1116
Gupta UC, Vijaya Laxmi P (2000) On the finite buffer bulk arrival GI X/E k /1/N queueing system. Opsearch 37:154–169
Gupta UC, Vijaya Laxmi P (2001) Analysis of MAP/G a,b/1/N queue. Queueing Syst 38:109–124
Gupta UC, Banik AD (2007) Complete analysis of finite and infinite buffer GI/MSP/1 queue—a computational approach. Oper Res Lett 35:273–280
Kasahara S, Takine T, Takahashi Y, Hasegawa T (1996) MAP/G/1 queues under N-policy with and without vacations. J Oper Res Soc Jpn 39:188–212
Lucantoni DM (1991) New results on the single server queue with a batch Markovian arrival process. Stoch Model 7:1–46
Lucantoni DM, Ramaswami V (1985) Efficient algorithms for solving non-linear matrix equations arising in phase type queues. Stoch Model 1:29–52
Lucantoni DM, Meier-Hellstern KS, Neuts MF (1990) A single-server queue with server vacations and a class of non-renewal process. Adv Appl Probab 22:676–705
Machihara F (1995) A G/SM/1 queue with vacations depending on service times. Stoch Model 11:671–690
Machihara F (1999) A BMAP/SM/1 queue with service times depending on the arrival process. Queueing Syst 33:277–291
Neuts MF (1981) Matrix-geometric solutions in stochastic models: an algorithmic approach. Johns Hopkins Univ Press, Baltimore
Niu Z, Shu T, Takahashi Y (2003) A vacation queue with set up and close-down times and batch Markovian arrival processes. Perform Eval 54:225–248
Nobel RD (1989) Practical approximations for finite buffer queueing models with batch arrivals. Eur J Oper Res 38:44–55
Ohsone T (1981) The GI/E k /1 queue with finite waiting room. J Oper Res Soc Jpn 24:375–391
Takagi H (1993) Queueing analysis—a foundation of performance evaluation, finite systems: vol 2. North-Holland, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Banik, A.D., Gupta, U.C. Analyzing the finite buffer batch arrival queue under Markovian service process: GI X/MSP/1/N . TOP 15, 146–160 (2007). https://doi.org/10.1007/s11750-007-0007-2
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11750-007-0007-2