×

The discrete-time \(MAP/PH/1\) queue with multiple working vacations. (English) Zbl 1185.90047

Summary: We consider a discrete-time single-server queueing model where arrivals are governed by a discrete Markovian arrival process (DMAP), which captures both burstiness and correlation in the interarrival times, and the service times and the vacation duration times are assumed to have a general phase-type distributions. The vacation policy is that of a working vacation policy where the server serves the customers at a lower rate during the vacation period as compared to the rate during the normal busy period. Various performance measures of this queueing system like the stationary queue length distribution, waiting time distribution and the distribution of regular busy period are derived. Through numerical experiments, certain insights are presented based on a comparison of the considered model with an equivalent model with independent arrivals, and the effect of the parameters on the performance measures of this model are analyzed.

MSC:

90B22 Queues and service in operations research
60K25 Queueing theory (aspects of probability theory)
Full Text: DOI

References:

[1] Tian, N.; Zhang, Z. G., Vacation Queueing Models: Theory and Applications (2006), Springer: Springer New York · Zbl 1104.60004
[2] Takagi, H., Queueing Analysis, Discrete Time Systems, vol. 3 (1993), Elsevier Science Publishers: Elsevier Science Publishers Amsterdam
[3] Zhang, Z. G.; Tian, N., Geo/G/1 queue with multiple adaptive vacations, Queueing Syst., 38, 419-429 (2001) · Zbl 1079.90525
[4] Tian, N.; Zhang, Z. G., The discrete time GI/Geo/1 queue with multiple vacations, Queueing Syst., 40, 283-294 (2002) · Zbl 0993.90029
[5] Servi, L. D.; Finn, S. G., M/M/1 queue with working vacations (M/M/1/WV), Perform. Eval., 50, 41-52 (2002)
[6] Wu, D.; Takagi, H., M/G/1 queue with multiple working vacations, Perform. Eval., 63, 7, 654-681 (2006)
[7] Baba, Y., Analysis of a GI/M/1 queue with multiple working vacations, Oper. Res. Lett., 33, 201-209 (2005) · Zbl 1099.90013
[8] Banik, A. D.; Gupta, U. C.; Pathak, S. S., On the GI/M/1/N queue with multiple working vacations – analytic analysis and computation, Appl. Math. Modell., 31, 9, 1701-1710 (2007) · Zbl 1167.90441
[9] Tian, N.; Ma, Z.; Liu, M., The discrete time Geom/Geom/1 queue with multiple working vacations, Appl. Math. Modell., 32, 12, 2941-2953 (2007) · Zbl 1167.90461
[10] Li, J. H.; Tian, N. S.; Liu, W. Y., Discrete-time GI/Geom/1 queue with multiple working vacations, Queueing Syst., 56, 53-63 (2007) · Zbl 1177.90095
[11] Alfa, A. S., A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service, Oper. Res. Lett., 18, 31-40 (1995) · Zbl 0858.60090
[12] Neuts, M. F., Matrix-Geometric Solutions in Stochastic Models (1981), John Hopkins University Press: John Hopkins University Press Baltimore · Zbl 0469.60002
[13] Breuer, L.; Baum, D., An Introduction to Queueing Theory and Matrix-Analytic Methods (2006), Springer: Springer Netherlands · Zbl 1132.60064
[15] Neuts, M. F., Some promising directions in algorithmic probability, (Alfa, A. S.; Chakravarthy, S., Advances in Matrix-analytic Methods for Stochastic Models (1998), Notable Publications), 429-443
[16] Alfa, A. S., Matrix-geometric solution of discrete time MAP/PH/1 priority queue, Naval Res. Logist., 45, 23-50 (1998) · Zbl 0902.90061
[17] Frigui, I.; Alfa, A. S., Analysis of a time limited polling system, Comput. Commun., 21, 558-571 (1998)
[19] Gupta, U. C.; Samanta, S. K.; Sharma, R. K.; Chaudhry, M. L., Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations, Perform. Eval., 64, 1-19 (2007)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.