Abstract
A two-class single-server retrial system with Poisson inputs is considered. In this system, unlike conventional retrial systems, each new ith class customer joins the ‘end’ of a virtual ith class orbit, and the ‘oldest’ customer from each orbit is only allowed to make an attempt to occupy server after a class-dependent exponential retrial time. Moreover, the server is assumed to be not reliable, and a customer whose service is interrupted joins the ‘top’ of class-i orbit queue. Thus FIFO discipline is applied in both orbits. Using regenerative methodology and Markov Chain approach we derive stability conditions of this system relying on analysis for less-complicated model with reliable server. Obtained conditions are verified by simulation. Additionally, we analyze a controllable variant of the main model operating under a \(c\mu \)-rule. For that case the system becomes less stable comparing to the non-controllable counterpart.
The research of RN was prepared with the support of Russian Science Foundation according to the research project No. 21-71-10135 https://rscf.ru/en/project/21-71-10135/. The research of EM was published with the financial support of the Ministry of Education and Science of the Russian Federation as part of the program of the Moscow Center for Fundamental and Applied Mathematics under the agreement № 075-15-2022-284.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9
Bramson, M.: Stability of queueing networks. Probab. Surv. 5, 165–345 (2008)
Cohen, J.W.: Analysis of Random Walks. IOS Press, Amsterdam (1992)
Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamentals of Queueing Theory, 4th edn. Wiley, Hoboken (2008)
Dimitriou, I.: A queueing model with two classes of retrial customers and paired services. Ann. Oper. Res. 238, 123–143 (2016). https://doi.org/10.1007/s10479-015-2059-2
Dimitriou, I.: A two-class queueing system with constant retrial policy and general class dependent service times. Eur. J. Oper. Res. 270, 1063–1073 (2018)
Avrachenkov, K., Morozov, E., Nekrasova, R.: Stability analysis of two-class retrial systems with constant retrial rates and general service times. Ar**v, abs/2110.09840 (2021)
Jain, M., Sanga, S.S.: Unreliable single server double orbit retrial queue with balking. Proc. Natl. Acad. Sci. India Sect. A Phys. Sci. 91, 257–268 (2021). https://doi.org/10.1007/s40010-020-00725-6
Sanga, S.S., Jain, M.: FM/FM/1 double orbit retrial queue with customers’ joining strategy: a parametric nonlinear programing approach. Appl. Math. Comput. 362, 124542 (2019)
Fayolle, G., Malyshev, V., Menshikov, M.: Topics in the Constructive Theory of Countable Markov Chains, 1st edn. Cambridge University Press, Cambridge (1995)
Buyukkoc, C., Varaiya, P., Walrand, J.: The \(c\mu \) rule revisited. Adv. Appl. Probab. 17(1), 237–238 (1985)
Cox, D.R., Smith, W.L.: Queues. Methuen, London (1961)
Morozov, E., Rogozin, S., Nguyen, H.Q., Phung-Duc, T.: Modified Erlang loss system for cognitive wireless networks. Mathematics 10, 2101 (2022). https://doi.org/10.3390/math10122101
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Nekrasova, R., Morozov, E., Efrosinin, D. (2022). Verification of Stability Condition in Unreliable Two-Class Retrial System with Constant Retrial Rates. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks: Control, Computation, Communications. DCCN 2022. Lecture Notes in Computer Science, vol 13766 . Springer, Cham. https://doi.org/10.1007/978-3-031-23207-7_23
Download citation
DOI: https://doi.org/10.1007/978-3-031-23207-7_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-23206-0
Online ISBN: 978-3-031-23207-7
eBook Packages: Computer ScienceComputer Science (R0)