Analysis of stationary queue-length distributions of the BMAP/R(a,b)/1 queue

This paper investigates an infinite waiting space single-server queueing system in which customers arrive according to a batch Markovian arrival process. The server serves the customers in batches of maximum size ‘b’ with a minimum threshold value ‘a’. The service time of each batch follows R-type distribution, where R-type distribution represents a class of distributions whose Laplace-Stieltjes transform is rational or approximated rational function, which is independent of service batch size and the arrival process. We determine the queue-length distribution at departure epoch in terms of roots of the associated characteristic equation of the vector probability generating function. To show the strength and advantage of roots method, we also provide a comprehensive analysis of the queue-length distribution at departure epoch using the matrix-analytic method (MAM). To determine the queue-length distribution at random epoch, we obtain a relation between the queue-length distributions at departure and random epochs using the supplementary variable technique with remaining service time of a batch in service as the supplementary variable. We also derive the queue-length distributions at pre-arrival epoch of an arrived batch and post-arrival epoch of a random customer of an arrived batch. Some numerical results are demonstrated for different service-time distributions to show the key performance measures of the system.

[1]  Mohan L. Chaudhry,et al.  A Simple and Complete Computational Analysis of MAP/R/1 Queue Using Roots , 2013 .

[2]  António Pacheco,et al.  Analysis of BMAP/MSP/1 Queue , 2016 .

[3]  Wolfgang Stadje,et al.  Applications of bulk queues to group testing models with incomplete identification , 2007, Eur. J. Oper. Res..

[4]  M. Neuts A General Class of Bulk Queues with Poisson Input , 1967 .

[5]  Herwig Bruneel,et al.  Analysis of a versatile batch-service queueing model with correlation in the arrival process , 2013, Perform. Evaluation.

[6]  U. C. Gupta,et al.  Reducing congestion in bulk-service finite-buffer queueing system using batch-size-dependent service , 2012, Perform. Evaluation.

[7]  U C Gupta,et al.  A computational approach for determination of system length distribution of a batch arrival and batch service queue , 2015 .

[8]  Christoph Lindemann,et al.  Traffic modeling and characterization for UMTS networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[9]  David M. Lucantoni,et al.  The BMAP/G/1 QUEUE: A Tutorial , 1993, Performance/SIGMETRICS Tutorials.

[10]  S. K. Samanta Waiting-time analysis of D-$${ BMAP}{/}G{/}1$$BMAP/G/1 queueing system , 2020, Ann. Oper. Res..

[11]  Mohan L. Chaudhry,et al.  On the Distribution of the Number of Customers in the D-BMAP/Ga,b/1/M Queue—A Simple Approach to a Complex Problem , 2010, INFOR Inf. Syst. Oper. Res..

[12]  U. C. Gupta,et al.  Analysis of the MAP/Ga,b/1/N Queue , 2001, Queueing Syst. Theory Appl..

[13]  Martin J. Fischer,et al.  An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue , 2004, INFORMS J. Comput..

[14]  Quan-Lin Li,et al.  An RG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue , 2005 .

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

[16]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .

[17]  M. L. Chaudhry,et al.  Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N , 2003 .

[18]  Gagandeep Singh,et al.  Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots , 2016, Journal of Applied Probability.

[19]  Chunming Qiao,et al.  Optical burst switching: a new area in optical networking research , 2004, IEEE Netw..

[20]  Qiming He,et al.  Analysis of a continuous time SM[K]/PH[K]/1/FCFS queue: Age process, sojourn times, and queue lengths , 2012, J. Syst. Sci. Complex..

[21]  Dieter Fiems,et al.  Efficient performance analysis of newly proposed sleep-mode mechanisms for IEEE 802.16m in case of correlated downlink traffic , 2013, Wirel. Networks.

[22]  Harry G. Perros,et al.  An introduction to optical burst switching , 2003, IEEE Commun. Mag..

[23]  H. R. Gail,et al.  Spectral analysis of M/G/1 and G/M/1 type Markov chains , 1996, Advances in Applied Probability.

[24]  S. Chakravarthy Analysis of a finite MAP/G/1 queue with group services , 1993, Queueing Syst. Theory Appl..

[25]  M. Neuts A Versatile Markovian Point Process , 1979 .

[26]  U. C. Gupta,et al.  Modeling and analysis of an infinite-buffer batch-arrival queue with batch-size-dependent service , 2017, Perform. Evaluation.

[27]  U. C. Gupta,et al.  Analysis of an infinite-buffer batch-size-dependent service queue with Markovian arrival process , 2019, Ann. Oper. Res..

[28]  A. D. Banik Single server queues with a batch Markovian arrival process and bulk renewal or non-renewal service , 2015 .

[29]  Veena Goswami,et al.  Discrete-time bulk-service queues with accessible and non-accessible batches , 2006, Appl. Math. Comput..

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

[31]  K. Sikdar,et al.  Analysis of a finite buffer variable batch service queue with batch Markovian arrival process and server’s vacation , 2016 .

[32]  S. K. Samanta,et al.  Analytical and computational studies of the queue , 2020 .

[33]  Michael P. Wiper,et al.  Bayesian Analysis of a Queueing System with a Long-Tailed Arrival Process , 2008, Commun. Stat. Simul. Comput..

[34]  Florin Avram,et al.  On bulk-service MAP/PHL,N/1/N G-Queues with repeated attempts , 2006, Ann. Oper. Res..

[35]  E. Arıkan,et al.  A numerically efficient method for the MAP/D/1/K queue via rational approximations , 1996 .

[36]  Christoph Lindemann,et al.  Modeling IP traffic using the batch Markovian arrival process , 2003, Perform. Evaluation.

[37]  A. D. Banik Queueing analysis and optimal control of and systems , 2009 .

[38]  Takemi Shigeta,et al.  A COMPUTATIONAL METHOD FOR THE BOUNDARY VECTOR OF A BMAP/G/1 QUEUE , 2006 .

[39]  Byung Kyu Kim,et al.  A simple eigenvalue method for low-order D-BMAP/G/1 queues , 2005 .

[40]  Che Soong Kim,et al.  Analysis of unreliable BMAP/PH/N type queue with Markovian flow of breakdowns , 2017, Appl. Math. Comput..

[41]  Mohan L. Chaudhry,et al.  Computational analysis of bulk service queue with Markovian arrival process: MAP/R(a, b)/1 queue , 2013 .

[42]  Mohan L. Chaudhry,et al.  An alternative method for computing system-length distributions of BMAP/R/1 and BMAP/D/1 queues using roots , 2016, Perform. Evaluation.

[43]  V. Ramaswami The N/G/1 queue and its detailed analysis , 1980, Advances in Applied Probability.

[44]  Srinivas R. Chakravarthy,et al.  Optimal Hysteretic Control for the BMAP/G/1 System with Single and Group Service Modes , 2002, Ann. Oper. Res..

[45]  S. R. Chakravarthy,et al.  Analysis of a finite-buffer bulk-service queue under Markovian arrival process with batch-size-dependent service , 2015, Comput. Oper. Res..

[46]  Che Soong Kim,et al.  A queueing system with batch arrival of customers in sessions , 2012, Comput. Ind. Eng..