Stationary regime for a queue of the type M|M|c|c + m with constant retrial rate

1Lebedev, EA
1Ponomarov, VD
1Taras Shevchenko National University of Kyiv
Dopov. Nac. akad. nauk Ukr. 2020, 7:22-31
https://doi.org/10.15407/dopovidi2020.07.022
Section: Information Science and Cybernetics
Language: Ukrainian
Abstract: 

A bivariate Markov process {X(t) = (X1(t), X2(t))T , t ⩾ 0} whose phase space is a lattice semistrip S(X) = {0,1,....,c +m}xZ is considered. The first component X1(t) ∈ {0,1,....,c+m} indicates the summarized number of busy servers and calls in the queue at the instant t ⩾ 0 , whereas the second one X2 (t) ∈ {0, 1, ...} is the number of retrial sources. Parameter c ∈ Z+ is a number of servers and m ∈ Z is a maximal size of the queue. Local rates of X(t) are defined in such a way that X(t) describes the service policy of a multi-server retrial queue in which the rate of repeated flow does not depend on the number of sources of repeated calls. First, using tools of the theory for the QBD-processes (quasi-birth-and-death processes), we study the ergodicity conditions. Then, under these conditions, we consider a problem of finding the steady state probabilities for X(t) . A vector-matrix representation of the probabilities via the model parameters is obtained. The applied technique uses an approximation of the initial model by a truncated one and the direct passage to the limit. The obtained formulae are the adequate method to calculate the steady state probabilities. An application of the main result is demonstrated via numerical examples in which we can see relation graphs of the blocking probability and the average number of retrials versus system parameters.

Keywords: ergodicity condition, service process, stationary regime, system with retrial calls, truncated model, vectormatrix representation
References: 

1. Falin, G. I., Templeton, J. G. C. (1997). Retrial queues. London: Chapman & Hall.
2. Choi, B. D., Shin, Y. W. & Ahn W.C. (1992). Retrial queues with collision arising from unslotted CSMA/CD protocol. Queueing Systems, No. 11. P. 335-356.
3. Avrachenkov, K. & Yechiali, U. (2008). Retrial networks with finite buffers and their application to internet data traffic. Probability in the Eng. and Informat. Sci., 22, pp. 519-536.
4. Avrachenkov, K. U. & Yechiali, U. (2010). On tandem blocking queues with a common retrial queue. Computers & Operations Research, 37, pp. 1174-1180.
5. Artalejo, J. R., Gomez-Corral, A. & Neuts, M. F. (2001). Analysis of multiserver queues with constant retrial rate. Eur. J. Operat. Research., 135, pp. 569-581.
6. Neuts, M. F. (1981). Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Baltimore: The Johns Hopkins Univ. Press.
7. Do, T. V. & Chakka, R. (2010). An efficient method to compute the rate matrix for retrial queues with large number of servers. Appl. Math. Lett., 23, pp. 638-643.
8. Artalejo, J. R. (1996). Stationary analysis of the characteristics of the M/M/2 queue with constant repeated attempts. Opsearch, 33, pp. 83-95.
9. Gomez-Corral, A. & Ramalhoto, M. F. (1999). The stationary distribution of a Markovian process arising in the theory of multiserver retrial queueing systems. Math. and Computer Modelling, 30, pp. 141-158.
10. Gomez-Corral, A. & Ramalhoto, M. F. (2000). On the waiting time distribution and the busy period of a retrial queue with constant retrial rate. Stochastic Modelling and Applications, 3 (2), pp. 37-47.
11. Artalejo, J. R. & Gomez-Corral, A. (2008). Retrial queueing systems. A computational approach. Berlin Heidelberg: Springer.
12. Walrand, J. (1993). An introduction to queueing networks. Мoscow: Mir (in Russian).
13. Horn, R. & Johnson, C. (1989). Matrix analysis. Мoscow: Мir (in Russian).