Abstract
We consider a multiclass multiserver retrial queuing system with classical retrial discipline: the customers, meeting server busy, are blocked on the corresponding (virtual) orbit and then retry to occupy server independently. The retrial times have general class-dependent distributions. The input process is renewal and a new arrival is class-i customer with a given probability \(p_i\). We exploit a regenerative structure of a basic process describing the dynamics of the system to establish stability conditions. More exactly, we show that, provided the retrial times belong to the New-Better-Than-Used class, the convenient requirement that the mean load (traffic intensity) is less than the number of servers, is the stability criterion of the model. A few numerical results are included which, in particular, show that this condition ensures stability of the system with the New-Worse-Than-Used Weibull retrial times as well.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Kim, J., Kim, B.: A survey of retrial queueing systems. Ann. Oper. Res. 247, 1–34 (2015)
Altman, E., Borovkov, A.A.: On the stability of retrial queues. Queueing Syst. 26, 343–363 (1997)
Asmussen, S.: Applied Probability and Queues, 2nd edn. Springer, New York (2003). https://doi.org/10.1007/b97236
Feller, W.: An Introduction to Probability Theory, vol. 2. Wiley, New York (1971)
Morozov, E., Phung-Duc, T.: Stability analysis of a multiclass retrial system with classical retrial policy. Perform. Eval. 112, 15–26 (2017)
Morozov, E.: A multiserver retrial queue: regenerative stability analysis. Queueing Syst. 56, 157–168 (2007)
Artalejo, J.R.: Accessible bibliography on retrial queues. Math. Comput. Modell. 30, 1–6 (1999)
Artalejo, J.R.: A classified bibliography of research on retrial queues: progress in 1990–1999. Top 7, 187–211 (1999)
Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems: A Computational Approach. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9
Billingsley, P.: Convergence of Probability Measures, 2nd edn. Wiley, New York (1999)
Falin, G.I., Templeton, J.G.D.: Retrial Queues. Chapman and Hall, London (1997)
Morozov, E., Delgado, R.: Stability analysis of regenerative queues. Autom. Remote Control 70, 1977–1991 (2009)
Artalejo, J.R., Phung-Duc, T.: Markovian retrial queues with two way communication. J. Ind. Manag. Optim. 8, 781–806 (2012)
Artalejo, J.R., Phung-Duc, T.: Single server retrial queues with two way communication. Appl. Math. Model. 37, 1811–1822 (2013)
Kang, W.: Fluid limits of many-server retrial queues with non-persistent customers. Queueing Syst. 79(2), 183–219 (2015)
Muller, A., Stoyan, D.: Comparison Methods for Stochastic Models and Risks. Wiley Series in Probability and Statistics. Wiley, Chichester (2002)
Sakurai, H., Phung-Duc, T.: Two-way communication retrial queues with types of outgoing calls. TOP 23, 466–492 (2015)
Smith, W.L.: Regenerative stochastic processes. Proc. Roy. Soc. A A(232), 6–31 (1955)
Acknowledgement
The study was carried out under state order to the Karelian Research Centre of the Russian Academy of Sciences (Institute of Applied Mathematical Research KRC RAS). The research is partly supported by Russian Foundation for Basic Research, projects 18-07-00147, 18-07-00156, 19-07-00303.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Morozov, E., Nekrasova, R. (2019). Stability Conditions of a Multiclass System with NBU Retrials. In: Phung-Duc, T., Kasahara, S., Wittevrongel, S. (eds) Queueing Theory and Network Applications. QTNA 2019. Lecture Notes in Computer Science(), vol 11688. Springer, Cham. https://doi.org/10.1007/978-3-030-27181-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-27181-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27180-0
Online ISBN: 978-3-030-27181-7
eBook Packages: Computer ScienceComputer Science (R0)