Analysis of an MAP/PH/1 Queue with Flexible Group Service

Abstract A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size. If the number of customers in the system at the service completion moment is less than this size, the server does not start the next service until the number of customers in the system reaches this size or a random limitation of the idle time of the server expires, whichever occurs first. Customers arrive according to a Markovian arrival process. An individual customer’s service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch. The dynamics of such a system are described by a multi-dimensional Markov chain. An ergodicity condition for this Markov chain is derived, a stationary probability distribution of the states is computed, and formulas for the main performance measures of the system are provided. The Laplace–Stieltjes transform of the waiting time is obtained. Results are numerically illustrated.

[1]  Marcel F. Neuts,et al.  DISTRIBUTION OF OCCUPATION TIME AND VIRTUAL WAITING TIME OF A GENERAL CLASS OF BULK QUEUES. , 1970 .

[2]  Evgenia Smirni,et al.  Trace data characterization and fitting for Markov modeling , 2010, Performance evaluation (Print).

[3]  Rostislav Razumchik,et al.  Analysis of an M|G|1|R queue with batch arrivals and two hysteretic overload control policies , 2014, Int. J. Appl. Math. Comput. Sci..

[4]  Che Soong Kim,et al.  Analysis of an MMAP/PH1, PH2/N/∞ queueing system operating in a random environment , 2014, Int. J. Appl. Math. Comput. Sci..

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

[6]  Srinivas R. Chakravarthy.  The Batch Markovian Arrival Process: A Review and Future Work , 2001 .

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

[8]  R. Serfozo,et al.  Optimal control of batch service queues , 1973, Advances in Applied Probability.

[9]  D. van Dantzig.  Chaînes de Markof dans les ensembles abstraits et applications aux processus avec régions absorbantes et au problème des boucles , 1955 .

[10]  Andrzej Chydzinski.  Transient analysis of the MMPP/G/1/K queue , 2006, Telecommun. Syst..

[11]  F. Downton,et al.  Waiting Time in Bulk Service Queues , 1955 .

[12]  Norman T. J. Bailey,et al.  On Queueing Processes with Bulk Service , 1954 .

[13]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[14]  Daniel P. Heyman,et al.  Modeling multiple IP traffic streams with rate limits , 2003, TNET.

[15]  Alexander N. Dudin,et al.  Single server retrial queue with group admission of customers , 2015, Comput. Oper. Res..

[16]  Ivan Atencia,et al.  A discrete-time system with service control and repairs , 2014, Int. J. Appl. Math. Comput. Sci..

[17]  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..

[18]  Alexander N. Dudin,et al.  Optimization of the service strategy in a queueing system with energy harvesting and customers’ impatience , 2016, Int. J. Appl. Math. Comput. Sci..

[19]  Miklós Telek,et al.  Fitting traffic traces with discrete canonical phase type distributions and Markov arrival processes , 2014, Int. J. Appl. Math. Comput. Sci..

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