Single server queues with a batch Markovian arrival process and bulk renewal or non-renewal service

Abstract

We first consider an infinite-buffer single server queue where arrivals occur according to a batch Markovian arrival process(BMAP). The server serves customers in batches of maximum size ‘b’ with a minimum threshold size ‘a’. The service time of each batch follows general distribution independent of each other as well as the arrival process. The proposed analysis is based on the use of matrix-analytic procedure to obtain queue-length distribution at a post-departure epoch. Next we obtain queue-length distributions at various other epochs such as, pre-arrival, arbitrary and pre-service using relations with post-departure epoch. Later we also obtain the system-length distributions at post-departure and arbitrary epochs using queue-length distribution at post-departure epoch. Some important performance measures, like mean queue-lengths and mean waiting times have been obtained. Total expected cost function per unit time is also derived to determine the locally optimal values of a and b. Secondly, we perform similar analysis for the corresponding infinite-buffer single server queue where arrivals occur according to a BMAP and service process in this case follows a non-renewal one, namely, Markovian service process (MSP).

Keywords

Bulk service (a, b)-rule / system-length distribution / infinite-buffer / queue / batch Markovian arrival process / Markovian service process / matrix-analytic procedure / cost control / cloud computing

References

[1] Albores-Velasco F J, Tajonar-Sanabria F S. Anlysis of the GI/MSP/c/r queueing system. Information Processes, 2004, 4: 46-57.

[2] Banik A D, Chaudhry M L, Gupta U C. On the finite buffer queue with renewal input and batch markovian service process: GI/BMSP/1/N. Methodology and Computing in Applied Probability, 2008, 10: 559-575.

[3] Banik A D, Gupta U C, Chaudhry M L. Finite-buffer bulk service queue under markovian service process: GI/MSP ^(a,b)/1/N. Stochastic Analysis and Applications, 2009, 27: 500-522.

[4] Banik A D. The infinite-buffer single server queue with a variant of multiple vacation policy and batch Markovian arrival process. Applied Mathematical Modelling, 2009, 33: 3025-3039.

[5] Banik A D. Queueing analysis and optimal control of BMAP/G ^(a,b)/1/N and BMAP/MSP ^(a,b)/1/N systems. Computers & Industrial Engineering, 2009, 57: 748-761.

[6] Banik A D. Analyzing state-dependent arrival in GI/BMSP/1/∞ queues. Mathematical and Computer Modelling, 2011, 53: 1229-1246.

[7] Bocharov P P. Stationary distribution of a finite queue with recurrent flow and Markovian service. Automation and Remote Control, 1996, 57: 66-78.

[8] Cha M S, Koo P-H, Joe J. Real-time control strategies of batch processing machines in semiconductor manufacturing. Proceedings of the Asia Pacific Industrial Engineering & Management Systems Conference, Patong Beach, Phuket, Thailand, 2012

[9] Chaudhry M L, Templeton J G C. A First Course in Bulk Queues, 1983, New York: Wiley.

[10] Chaudhry M L, Gupta U C. Modelling and analysis of M/G ^(a,b)/1/N queue — a simple alternative approach. Queueing Systems, 1999, 31: 95-100.

[11] Chakravarthy S. Analysis of a finite MAP/G/1 queue with group services. Queueing Systems, 1993, 13: 385-407.

[12] Dshalalow J H. Frontiers in Queueing: Models and Applications in Science and Engineering, 1997, Boca Raton, FL.: CRC Press.

[13] Goswami V, Patra S S, Mund G B. Performance analysis of cloud computing centers for bulk services. International Journal of Cloud Applications and Computing, 2012, 2(4): 53-65.

[14] Grassmann W K, Taksar M I, Heyman D P. Regenerative analysis and steady state distributions for Markov chains. Operations Research, 1985, 33: 1107-1116.

[15] Gupta U C, Banik A D. Complete analysis of finite and infinite buffer GI/MSP/1 queue — a computational approach. Operations Research Letters, 2007, 35: 273-280.

[16] Harris C M, Marchal W G. Distribution estimation using Laplace transforms. INFORMS journal on Computing, 1998, 10: 448-458.

[17] Lee H S, Srinivasan M M. Control policies for the M ^[X]/G/1 queueing system. Management Science, 1989, 35: 708-721.

[18] Lee H W, Park J O. Optimal strategy in N-policy production system with early set-up. Journal Operational Research Society, 1997, 48: 306-313.

[19] Lucantoni D M. New results on the single server queue with a batch Markovian arrival process. Stochactic Models, 1991, 7: 1-46.

[20] Lucantoni D M, Neuts M F. Some steady-state distributions for the MAP/SM/1 queue. Stochastic Models, 1994, 10: 575-598.

[21] Lucantoni D M, Meier-Hellstern K S, Neuts M F. A single-server queue with server vacations and a class of non-renewal arrival process. Advances in Applied Probability, 1990, 22: 676-705.

[22] Neuts M F. A versatile Markovian point process. Journal of Applied Probability, 1979, 16: 764-779.

[23] Neuts M F. Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach, 1981, Baltimore, MD: Johns Hopkins Univ. Press.

[24] Neuts M F. Structured stochastic matrices of M/G/1 type and their applications, 1989, New York: Marcel Dekker.

[25] Neuts M F. Models based on the Markovian arrival process. IEICE Transactions on Communication, 1992, E75-B: 1255-1265.

[26] Ramaswami V. A stable recursion for the steady state vector in Markov chain M/G/1 type. Stochastic Models, 1988, 4: 183-188.

[27] Shanthikumar J G, Ding S, Zhang M T. Queueing theory for semiconductor manufacturing systems: a survey and open problems. IEEE Transactions on Automation Science and Engineering, 2007, 4: 513-522.

[28] Sikdar K, Gupta U C. The queue length distributions in the finite buffer bulk-service MAP/G/1 queue with multiple vacations. TOP, 2005, 13(1): 75-103.