## Journal of Applied Probability

### Steady-state analysis of a multiclass MAP/PH/c queue with acyclic PH retrials

#### Abstract

A multiclass c-server retrial queueing system in which customers arrive according to a class-dependent Markovian arrival process (MAP) is considered. Service and retrial times follow class-dependent phase-type (PH) distributions with the further assumption that PH distributions of retrial times are acyclic. A necessary and sufficient condition for ergodicity is obtained from criteria based on drifts. The infinite state space of the model is truncated with an appropriately chosen Lyapunov function. The truncated model is described as a multidimensional Markov chain, and a Kronecker representation of its generator matrix is numerically analyzed.

#### Article information

Source
J. Appl. Probab. Volume 53, Number 4 (2016), 1098-1110.

Dates
First available in Project Euclid: 7 December 2016

http://projecteuclid.org/euclid.jap/1481132839

Mathematical Reviews number (MathSciNet)
MR3581244

Zentralblatt MATH identifier
06675900

#### Citation

Dayar, Tuǧrul; Can Orhan, M. Steady-state analysis of a multiclass MAP/PH/ c queue with acyclic PH retrials. J. Appl. Probab. 53 (2016), no. 4, 1098--1110. http://projecteuclid.org/euclid.jap/1481132839.

#### References

• Artalejo, J. R. (1999). Accessible bibliography on retrial queues. Math. Comput. Modelling 30, 1–6.
• Artalejo, J. R. (2010). Accessible bibliography on retrial queues: progress in 2000–2009. Math. Comput. Modelling 51, 1071–1081.
• Artalejo, J. R. and Gómez-Corral, A. (2007). Modelling communication systems with phase type service and retrial times. IEEE Commun. Lett. 11, 955–957.
• Artalejo, J. R. and Gómez-Corral, A. (2008). Retrial Queueing Systems: A Computational Approach. Springer, Berlin.
• Artalejo, J. R. and Phung-Duc, T. (2012). Markovian retrial queues with two way communication. J. Ind. Manag. Optimization 8, 781–806.
• Asmussen, S. (2003). Applied Probability and Queues (Appl. Math. (New York) 51). Springer, New York.
• Avrachenkov, K., Morozov, E. and Steyaert, B. (2016). Sufficient stability conditions for multi-class constant retrial rate systems. Queueing Systems 82, 149–171.
• Baumann, H., Dayar, T., Orhan, M. C. and Sandmann, W. (2013). On the numerical solution of Kronecker-based infinite level-dependent QBD processes. Performance Evaluation 70, 663–681.
• Bause, F., Buchholz, P. and Kemper, P. (1998). A toolbox for functional and quantitative analysis of DEDS. In Computer Preformance Evaluation (Lecture Notes Comput. Sci. 1469), Springer, Berlin, pp. 356–359.
• Breuer, L., Dudin, A. and Klimenok, V. (2002). A retrial BMAP/PH/N system. Queueing Systems 40, 433–457.
• Bright, L. and Taylor, P. G. (1995). Calculating the equilibrium distribution in level dependent quasi-birth-and-death processes. Commun. Statist. Stoch. Models 11, 497–525.
• Buchholz, P., Kriege, J. and Felko, I. (2014). Input Modeling with Phase-Type Distributions and Markov Models: Theory and Applications. Springer, Cham.
• Chakravarthy, S. R. (2013). Analysis of MAP/PH/c retrial queue with phase type retrials – simulation approach. In Modern Probabilistic Methods for Analysis of Telecommunication Networks (Commun. Comput. Inf. Sci. 356), Springer, Berlin, pp. 37–49.
• Chiola, G., Dutheillet, C., Franceschinis, G. and Haddad, S. (1993). Stochastic well-formed colored nets and symmetric modeling applications. IEEE Trans. Comput. 42, 1343–1360.
• Choi, B. D. and Chang, Y. (1999). MAP$_1$,MAP$_2$/M/c retrial queue with the retrial group of finite capacity and geometric loss. Math. Comput. Modelling 30, 99–113.
• Choi, B. D., Chang, Y. and Kim, B. (1999). MAP$_1$,MAP$_2$/M/c retrial queue with guard channels and its application to cellular networks. Top 7, 231–248.
• Dayar, T. and Orhan, M. C. RetrialQueueSolver. Available at http://www.cs.bilkent.edu.tr/$\sim$tugrul/software. html.
• Dayar, T. and Orhan, M. C. (2012). Kronecker-based infinite level-dependent QBD processes. J. Appl. Prob. 49, 1166–1187.
• Dayar, T., Hermanns, H., Spieler, D. and Wolf, V. (2011). Bounding the equilibrium distribution of Markov population models. Numer. Linear Algebra Appl. 18, 931–946.
• Dayar, T., Sandmann, W., Spieler, D. and Wolf, V. (2011). Infinite level-dependent QBD processes and matrix-analytic solutions for stochastic chemical kinetics. Adv. Appl. Prob. 43, 1005–1026.
• Diamond, J. E. and Alfa, A. S. (1998). The MAP/PH/1 retrial queue. Commun. Statist. Stoch. Models 14, 1151–1177.
• Diamond, J. E. and Alfa, A. S. (1999). Approximation method for M/PH/1 retrial queues with phase type inter-retrial times. Europ. J. Operat. Res. 113, 620–631.
• Dudin, A. and Klimenok, V. (2000). A retrial BMAP/SM/1 system with linear repeated requests. Queueing Systems Theory Appl. 34, 47–66.
• Falin, G. I. (1988). On a multiclass batch arrival retrial queue. Adv. Appl. Prob. 20, 483–487.
• Falin, G. I. and Templeton, J. G. C. (1997). Retrial Queues. Chapman & Hall, London.
• Fayolle, G., Malyshev, V. A. and Menshikov, M. V. (1995). Topics in the Constructive Theory of Countable Markov Chains. Cambridge University Press.
• Gharbi, N., Dutheillet, C. and Ioualalen, M. (2009). Colored stochastic Petri nets for modelling and analysis of multiclass retrial systems. Math. Comput. Modelling 49, 1436–1448.
• Gómez-Corral, A. (2006). A bibliographical guide to the analysis of retrial queues through matrix analytic techniques. Ann. Operat. Res. 141, 163–191.
• He, Q.-M., Li, H. and Zhao, Y. Q. (2000). Ergodicity of the BMAP/PH/$s$/$s$+$K$ retrial queue with PH-retrial times. Queueing Systems Theory Appl. 35, 323–347.
• Kim, B. (2011). Stability of a retrial queueing network with different classes of customers and restricted resource pooling. J. Ind. Manag. Optimization 7, 753–765.
• Kim, C. S., Mushko, V. and Dudin, A. N. (2012). Computation of the steady state distribution for multi-server retrial queues with phase type service process. Ann. Operat. Res. 201, 307–323.
• Kim, J. and Kim, B. (2016). A survey of retrial queueing systems. To appear in Ann. Operat. Res.
• Kulkarni, V. G. (1986). Expected waiting times in a multiclass batch arrival retrial queue. J. Appl. Prob. 23, 144–154.
• Kumar, M. S., Sohraby, K. and Kiseon, K. (2013). Delay analysis of orderly reattempts in retrial queueing system with phase type retrial time. IEEE Commun. Lett. 17, 822–825.
• Meyer, C. (2000). Matrix Analysis and Applied Linear Algebra. SIAM, Philadelphia, PA.
• Neuts, M. F. (1979). A versatile Markovian point process. J. Appl. Prob. 16, 764–779.
• Neuts, M. F. (1981). Matrix-Geometric Solutions in Stochastic Models: An Algorithmic Approach. Johns Hopkins University Press, Baltimore, MD.
• Neuts, M. F. and Rao, B. M. (1990). Numerical investigation of a multiserver retrial model. Queueing Systems 7, 169–189.
• Phung-Duc, T. and Kawanishi, K. (2011). Multiserver retrial queues with after-call work. Numer. Algebra Control Optimization 1, 639–656.
• Phung-Duc, T. and Kawanishi, K. (2014). Performance analysis of call centers with abandonment, retrial and after-call work. Performance Evaluation 80, 43–62.
• Phung-Duc, T., Masuyama, H., Kasahara, S. and Takahashi, Y. (2010). A simple algorithm for the rate matrices of level-dependent QBD processes. In Proceedings of the 5th International Conference on Queueing Theory and Network Applications, ACM, New York, pp. 46–52.
• Ramaswami, V. and Lucantoni, D. M. (1985). Algorithms for the multiserver queue with phase-type service. Commun. Statist. Stoch. Models 1, 393–417.
• Sakurai, H. and Phung-Duc, T. (2015). Two-way communication retrial queues with multiple types of outgoing calls. TOP 23, 466–492.
• Shin, Y. W. (2011). Algorithmic solution for M/M/c retrial queue with PH$_2$-retrial times. J. Appl. Math. Inform. 29, 803–811.
• Shin, Y. W. and Moon, D. H. (2011). Approximation of M/M/c retrial queue with PH-retrial times. Europ. J. Operat. Res. 213, 205–209.
• Shin, Y. W. and Moon, D. H. (2014). M/M/c retrial queue with multiclass of customers. Methodol. Comput. Appl. Prob. 16, 931–949.
• Tweedie, R. L. (1975). Sufficient conditions for regularity, recurrence and ergodicity of Markov processes. Math. Proc. Camb. Phil. Soc. 78, 125–136.
• Uysal, E. and Dayar, T. (1998). Iterative methods based on splittings for stochastic automata networks. Europ. J. Operat. Res. 110, 166–186.