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.
@article{bwmeta1.element.bwnjournal-article-amcv27i1p119bwm,
author = {Arianna Brugno and Ciro D'Apice and Alexander Dudin and Rosanna Manzo},
title = {Analysis of an MAP/PH/1 queue with flexible group service},
journal = {International Journal of Applied Mathematics and Computer Science},
volume = {27},
year = {2017},
pages = {119-131},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-amcv27i1p119bwm}
}
Arianna Brugno; Ciro D'Apice; Alexander Dudin; Rosanna Manzo. Analysis of an MAP/PH/1 queue with flexible group service. International Journal of Applied Mathematics and Computer Science, Tome 27 (2017) pp. 119-131. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-amcv27i1p119bwm/
[000] Atencia, I. (2014). A discrete-time system with service control and repairs, International Journal of Applied Mathematics and Computer Science 24(3): 471-484, DOI: 10.2478/amcs-2014-0035. | Zbl 1322.90019
[001] Bailey, N. (1954). On queueing processes with bulk service, Journal of the Royal Statistical Society B 16(1): 80-87. | Zbl 0055.36906
[002] Banerjee, A., Gupta, U. and Chakravarthy, S. (2015). Analysis of afinite-buffer bulk-service queue under Markovian arrival process with batch-size-dependent service, Computers and Operations Research 60: 138-149. | Zbl 1348.90193
[003] Casale, G., Zhang, E. and Smirn, E. (2010). Trace data characterization and fitting for Markov modeling, Performance Evaluation 67(2): 61-79.
[004] Chakravarthy, S. (2001). The batch Markovian arrival process: A review and future work, in V.R.E.A. Krishnamoorthy and N. Raju (Eds.), Advances in Probability Theory and Stochastic Processes, Notable Publications Inc., Branchburg, NJ, pp. 21-29.
[005] Chydzinski, A. (2006). Transient analysis of the MMPP/G/1/K queue, Telecommunication Systems 32(4): 247-262.
[006] Deb, R. and Serfozo, R. (1973). Optimal control of batch service queues, Advances in Applied Probability 5(2): 340-361. | Zbl 0264.60066
[007] Downton, F. (1955). Waiting time in bulk service queues, Journal of the Royal Statistical Society B 17(2): 256-261. | Zbl 0067.11001
[008] Dudin, A., Manzo, R. and Piscopo, R. (2015). Single server retrial queue with adaptive group admission of customers, Computers and Operations Research 61: 89-99. | Zbl 1348.90195
[009] Dudin, A., Lee, M.H. and Dudin, S. (2016). Optimization of the service strategy in a queueing system with energy harvesting and customers' impatience, International Journal of Applied Mathematics and Computer Science 26(2): 367-378, DOI: 10.1515/amcs-2016-0026. | Zbl 1347.93269
[010] Gaidamaka, Y., Pechinkin, A., Razumchik, R., Samouylov, K. and Sopin, E. (2014). Analysis of an M/G/1/R queue with batch arrivals and two hysteretic overload control policies, International Journal of Applied Mathematics and Computer Science 24(3): 519-534, DOI: 10.2478/amcs-2014-0038. | Zbl 1322.60190
[011] Heyman, D. and Lucantoni, D. (2003). Modelling multiple IP traffic streams with rate limits, IEEE/ACM Transactions on Networking 11(6): 948-958.
[012] Kesten, H. and Runnenburg, J. (1956). Priority in Waiting Line Problems, Mathematisch Centrum, Amsterdam. | Zbl 0085.34801
[013] Kim, C., Dudin, A., Dudin, S. and Dudina, O. (2014). Analysis of an M M AP/P H1 , P H2 /N/∞ queueing system operating in a random environment, International Journal of Applied Mathematics and Computer Science 24(3): 485-501, DOI: 10.2478/amcs-2014-0036. | Zbl 1322.60195
[014] Klemm, A., Lindermann, C. and Lohmann, M. (2003). Modelling IP traffic using the batch Markovian arrival process, Performance Evaluation 54(2): 149-173.
[015] Lucatoni, D. (1991). New results on the single server queue with a batch Markovian arrival process, Communication in Statistics: Stochastic Models 7(1): 1-46.
[016] Mèszáros, A., Papp, J. and Telek, M. (2014). Fitting traffic with discrete canonical phase type distribution and Markov arrival processes, International Journal of Applied Mathematics and Computer Science 24(3): 453-470, DOI: 10.2478/amcs-2014-0034. | Zbl 1322.93092
[017] Neuts, M. (1967). A general class of bulk queues with Poisson input, The Annals of Mathematical Statistics 38(3): 759-770. | Zbl 0157.25204
[018] Neuts, M. (1981). Matrix-geometric Solutions in Stochastic Models-An Algorithmic Approach, Johns Hopkins University Press, Baltimore, MD. | Zbl 0469.60002
[019] Sasikala, S. and Indhira, K. (2016). Bulk service queueing models-a survey, International Journal of Pure and Applied Mathematics 106(6): 43-56.
[020] van Dantzig, D. (1955). Chaines de markof dans les ensembles abstraits et applications aux processus avec regions absorbantes et au probleme des boucles, Annales de l'Institut Henri Poincaré 14(3): 145-199. | Zbl 0066.37702