zbMATH — the first resource for mathematics

Computation of the moments of queue length in the $$BMAP / SM / 1$$ queue. (English) Zbl 1409.90062
Summary: The $$BMAP / S M / 1$$ queue is the most general single-server queueing model which can be analysed analytically. Problem of computation of stationary distributions of queue length is solved in the literature. However, the problem of computation of the moments of these distributions is not enough addressed. This problem is more complicated than its particular case when the service times are independent identically distributed random variables due to reducibility of some involved matrices. In this communication, we solve this problem.
MSC:
 90B22 Queues and service in operations research 60K25 Queueing theory (aspects of probability theory)
Full Text:
References:
 [1] M.M. Abhishek Boon, O.O. Boxma, R.R.N. Queija, A single server queue with batch arrivals and semi-Markov services, (2016) Eurandom Preprint Series. · Zbl 1395.60105 [2] Chakravarthy, S. R., The batch Markovian arrival process: A review and future work, (Krishnamoorthy, A.; etal., Advances in Probability Theory and Stochastic Processes, (2001), Notable Publications NJ), 21-49 [3] Cinlar, E., Introduction To Stochastic Processes, (1975), Prentice-Hall New Jersey · Zbl 0341.60019 [4] Dudin, A. N.; Klimenok, V. I., Multi-dimensional quasitoeplitz Markov chains, J. Appl. Math. Stoch. Anal., 12, 393-415, (1999) · Zbl 0959.60092 [5] Dudin, A. N.; Klimenok, V. I., Queueing System with Correlated Arrival Processes, (2000), Belarusian University Publisher Minsk, in Russian [6] Dudin, A.; Klimenok, V.; Lee, M. H., Recursive formulas for the moments of queue length in the $$B M A P / G / 1$$ queue, IEEE Commun. Lett., 13, 351-353, (2009) [7] F., Machihara, A $$B M A P / S M / 1$$ queue with service times depending on the arrival process, Queueing Syst., 33, 277-291, (1999) · Zbl 0938.90013 [8] Gail, H. R.; Hantler, S. L.; Taylor, B. A., Spectral analysis of $$M / G / 1$$ and $$G / M / 1$$ type Markov chains, Adv. Appl. Probab., 28, 114-165, (1996) · Zbl 0845.60092 [9] Graham, A., Kronecker Products and Matrix Calculus with Applications, (1981), Ellis Horwood Cichester · Zbl 0497.26005 [10] Klimenok, V.; Dudin, A., Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory, Queueing Syst., 54, 245-259, (2006) · Zbl 1107.60060 [11] Lucantoni, D., New results on the single server queue with a batch Markovian arrival process, Commun. Stat.-Stoch. Models, 7, 1-46, (1991) · Zbl 0733.60115 [12] Lucantoni, D.; Neuts, M., Some steady-state distribution for the $$M A P / S M / 1$$ queue, Commun. Stat.-Stoch. Models, 10, 575-598, (1994) · Zbl 0804.60086 [13] Neuts, M. F., Structured Stochastic Matrices of $$M / G / 1$$ Type and their Applications, (1989), Marcel Dekker New York [14] Ramaswami, V., The $$N / G / 1$$ queue and its detailed analysis, Adv. Appl. Probab., 12, 222-261, (1980) · Zbl 0424.60093 [15] Ramaswami, V., Matrix analytic methods: A tutorial overview with some extensions and new results, Matrix Anal. Methods Stoch. Models, 26, 1-296, (1997) · Zbl 0872.60067 [16] Sengupta, B., The semi-Markovian queues: theory and applications, Commun. Stat.-Stoch. Models, 6, 383-413, (1990) · Zbl 0699.60090 [17] Singh, G.; Gupta, U. C.; Chaudhry, M. L., Detailed computational analysis of queueing-time distributions of the $$B M A P / G / 1$$ queue using roots, J. Appl. Probab., 53, 1078-1097, (2016) · Zbl 1356.60158 [18] de Smit, J. H., The single server semi-Markov queue, Stochastic Process. Appl., 22, 37-50, (1986) · Zbl 0606.60086 [19] Tari, A.; Telek, M.; Buchholz, P., A unified approach to the moments based distribution estimation -unbounded support, Lecture Notes in Comput. Sci., 3670, 79-93, (2005)
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.