Efficient Computational Analysis of Stationary Probabilities for the Queueing System BMAP/G/1/N With or Without Vacation(s)

References

• Blondia C (1991) Finite capacity vacation model with non-renewal input. J. Appl. Prob. 28(1):174–197.Crossref, Google Scholar
• Chakka R (1998) Spectral expansion solution for some finite capacity queues. Ann. Oper. Res. 79:27–44.Crossref, Google Scholar
• Chaudhry ML, Templeton JGC (1983) A First Course in Bulk Queues (John Wiley & Sons, New York).Google Scholar
• Çinlar E (1975) Introduction to Stochastic Process (Prentice Hall, Upper Saddle River, NJ).Google Scholar
• Dudin AN, Shaban AA, Klimenok VI (2005) Analysis of a queue in the BMAP/G/1/N system. Internat. J. Simulation 6(1–2):13–23.Google Scholar
• Grassmann WK, Taksar MI, Heyman DP (1985) Regenerative analysis and steady state distributions for Markov chains. Oper. Res. 33(5):1107–1116.Link, Google Scholar
• Kasahara S, Takine T, Suda T, Hasegawa T (1996) MAP/G/1 queues under N-policy with and without vacations. J. Oper. Res. Soc. Japan 39(2):188–212.Crossref, Google Scholar
• Koucheryavy Y, Moltchanov D, Giambene G, Harju J (2004) Teletraffic requirements and system aspects for future mobile communications. Hamza MH, ed. Proc. Eighth IASTED Internat. Conf. Internet Multimedia Systems Appl., Kauai, Hawaii, 150–157.Google Scholar
• Latouche G, Ramaswami V (1999) Introduction to Matrix Analytic Methods in Stochastic Modelling (SIAM & ASA, Philadelphia).Crossref, Google Scholar
• Lucantoni DM (1991) New results on the single server queue with a batch Markovian arrival process. Stochastic Models 7(1):1–46.Crossref, Google Scholar
• Lucantoni DM, Neuts MF (1994) Some steady-state distributions for the MAP/SM/1 queue. Commun. Stat. Stochastic Models 10(3): 575–598.Crossref, Google Scholar
• Lucantoni DM, Meier-Hellstern KS, Neuts MF (1990) A single-server queue with server vacations and a class of non-renewal process. Adv. Appl. Probab. 22(3):676–705.Crossref, Google Scholar
• Moltchanov D, Koucheryavy Y, Harju J (2006) Loss performance model for wireless channels with autocorrelated arrivals and losses. Comput. Comm. 29(13–14):2646–2660.Crossref, Google Scholar
• Neuts MF (1979) A versatile Markovian point process. J. Appl. Probab. 16(4):764–779.Crossref, Google Scholar
• Neuts MF (1981) Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach (Johns Hopkins University Press, Baltimore).Google Scholar
• Niu Z, Takahashi Y (1999) A finite-capacity queue with exhaustive vacation/close-down/setup times and Markovian arrival processes. Queueing Systems 31(1):1–23.Crossref, Google Scholar
• Niu Z, Shu T, Takahashi Y (2003) A vacation queue with set up and close-down times and batch Markovian arrival processes. Performance Eval. 54(3):225–248.Crossref, Google Scholar
• Ramaswami V (1980) The N/G/1 queue and its detailed analysis. Adv. Appl. Prob. 12(1):222–261.Crossref, Google Scholar
• Samanta SK, Gupta UC, Sharma RK (2007) Analyzing discrete-time D-BMAP/G/1/N queue with single and multiple vacations. Eur. J. Oper. Res. 182(1):321–339.Crossref, Google Scholar
• Shortle JF, Brill PH, Fischer MJ, Gross D, Masi DMB (2004) An algorithm to compute the waiting time distribution for the M/G/1 queue. INFORMS J. Comput. 16(2):152–161.Link, Google Scholar
• Tian N, Zhang ZG (2006) Vacation Queueing Models: Theory and Applications. International Series in Operations Research and Management Science (Springer, New York).Crossref, Google Scholar
• Yu M, Alfa AS (2015) Algorithm for computing the queue length distribution at various time epochs in DMAP/G(1, a, b)/1/N queue with batch-size–dependent service time. Eur. J. Oper. Res. 244(1):227–239.Crossref, Google Scholar