Verification of Stability Condition in Unreliable Two-Class Retrial System with Constant Retrial Rates

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks: Control, Computation, Communications (DCCN 2022)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 67.40
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
EUR 85.59
Price includes VAT (Germany)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Artalejo, J.R., Gomez-Corral, A.: Retrial Queueing Systems. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78725-9

    Book  MATH  Google Scholar 

  2. Bramson, M.: Stability of queueing networks. Probab. Surv. 5, 165–345 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  3. Cohen, J.W.: Analysis of Random Walks. IOS Press, Amsterdam (1992)

    MATH  Google Scholar 

  4. Gross, D., Shortle, J.F., Thompson, J.M., Harris, C.M.: Fundamentals of Queueing Theory, 4th edn. Wiley, Hoboken (2008)

    Book  MATH  Google Scholar 

  5. 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

    Article  MathSciNet  MATH  Google Scholar 

  6. 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)

    Article  MathSciNet  MATH  Google Scholar 

  7. 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)

    Google Scholar 

  8. 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

    Article  MathSciNet  MATH  Google Scholar 

  9. 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)

    MathSciNet  MATH  Google Scholar 

  10. Fayolle, G., Malyshev, V., Menshikov, M.: Topics in the Constructive Theory of Countable Markov Chains, 1st edn. Cambridge University Press, Cambridge (1995)

    Book  MATH  Google Scholar 

  11. Buyukkoc, C., Varaiya, P., Walrand, J.: The \(c\mu \) rule revisited. Adv. Appl. Probab. 17(1), 237–238 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Cox, D.R., Smith, W.L.: Queues. Methuen, London (1961)

    Google Scholar 

  13. 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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ruslana Nekrasova .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Navigation