Skip to main content
SpringerLink
Log in

On Exponential Convergence of Dynamic Queueing Network and Its Applications

  • Conference paper
  • First Online:
Distributed Computer and Communication Networks (DCCN 2020)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 12563))

  • 656 Accesses

Abstract

This paper is a continuation of previous research in ergodicity of some models for unreliable networks. The set of random graphs and the sequence of matrixes describing the failure and recovery process has been used instead of the fixed graph for network structure. The main results about an ergodicity and bounds for rate of convergence to stationary distribution are formulated under more general assumptions on intensity rates.

The publication has been prepared with the support of the Russian Foundation for Basic Research according to the research project No.20-01-00575 A.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Liggett, T.H. Interacting Particle Systems. Springer, New York (1999). https://doi.org/10.1007/978-1-4613-8542-4

  2. van Doorn, E.A.: Representations for the rate of convergence of birth-death processes. Memorandum / Department of Applied Mathematics; No. 1584. University of Twente, Department of Applied Mathematics (2001)

    Google Scholar 

  3. Kalimulina, E.Y.: Analysis of unreliable open queueing network with dynamic routing. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2017. CCIS, vol. 700, pp. 355–367. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-66836-9_30

    Chapter  Google Scholar 

  4. Kalimulina, E.Y.: Rate of convergence to stationary distribution for unreliable Jackson-type queueing network with dynamic routing. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds.) DCCN 2016. CCIS, vol. 678, pp. 253–265. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-51917-3_23

    Chapter  Google Scholar 

  5. Chen, M.-F.: Eigenvalues, Inequalities, and Ergodic Theory. Springer, Heidelberg (2005)

    Google Scholar 

  6. Liggett, T.H.: Exponential convergence of attractive reversible nearest particle systems. Ann. Prob. 17, 403–432 (1989)

    Article  MathSciNet  Google Scholar 

  7. Sauer, C., Daduna, H.: Availability, formulae and performance measures for separable degradable networks. Econ. Qual. Control 18(2), 165–194 (2003)

    Article  MathSciNet  Google Scholar 

  8. Lawler, G.F., Sokal, A.D.: Bounds on the \(L_2\) spectrum for Markov chains and Markov processes: a generalization of Cheeger’s inequality. Trans. Am. Math. Soc. 309(2), 557–580 (1988)

    MATH  Google Scholar 

  9. van Doorn, E.: Representations for the rate of convergence of birth-death processes. Theory Probab. Math. Stat. 65, 37–43 (2002)

    MathSciNet  Google Scholar 

  10. Zeifman, A.I.: Some estimates of the rate of convergence for birth and death processes. J. Appl. Probab. 28, 268–277 (1991)

    Article  MathSciNet  Google Scholar 

  11. Van, Z.A.I., Doorn, E.A., Zeifman, A.I.: On the speed of convergence to stationarity of the Erlang loss system. Queueing Syst. 63, 241 (2009). https://doi.org/10.1007/s11134-009-9134-9

    Article  MathSciNet  MATH  Google Scholar 

  12. Lorek, P., Szekli, R.: Computable bounds on the spectral gap for unreliable Jackson networks. Adv. Appl. Probab. 47(2), 402–424 (2015)

    Article  MathSciNet  Google Scholar 

  13. Lorek, P.: The exact asymptotic for the stationary distribution of some unreliable systems. arXiv:1102.4707 (2011)

  14. Doeblin, W.: Mathématique de l’Union Interbalkanique (1938)

    Google Scholar 

  15. Albert, R., Barabasi, A.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74(1), 47–97. arXiv:cond-mat/0106096

  16. Dorogovtsev, S.N., Mendes, J.F.F.: Evolution of Networks: From Biological Nets to the Internet and WWW (Physics). Oxford University Press Inc., New York (2003)

    Book  Google Scholar 

  17. Zverkina, G.: Stationary coupling method for renewal process in continuous time (application to strong bounds for the convergence rate of the distribution of the regenerative process). arXiv preprint. arXiv:1704.04808 (2017)

  18. Zverkina, G.: Lorden’s inequality and coupling method for backward renewal process. arXiv preprint. arXiv:1706.00922 (2017)

  19. Kalimulina, E.Y., Zverkina, G.A.: On some generalization of Lorden’s inequality for renewal processes. arXiv preprint. arXiv:1910.03381

Download references

Author information

Authors and Affiliations

  1. Institute of Control Sciences of Russian Academy of Sciences, Moscow, Russia

    Elmira Yu. Kalimulina

Authors
  1. Elmira Yu. Kalimulina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Elmira Yu. Kalimulina .

Editor information

Editors and Affiliations

  1. Institute of Control Sciences of the Russian Academy of Sciences, Moscow, Russia

    Vladimir M. Vishnevskiy

  2. RUDN University, Moscow, Russia

    Konstantin E. Samouylov

  3. Institute of Control Sciences of the Russian Academy of Sciences, Moscow, Russia

    Dmitry V. Kozyrev

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kalimulina, E.Y. (2020). On Exponential Convergence of Dynamic Queueing Network and Its Applications. In: Vishnevskiy, V.M., Samouylov, K.E., Kozyrev, D.V. (eds) Distributed Computer and Communication Networks. DCCN 2020. Lecture Notes in Computer Science(), vol 12563. Springer, Cham. https://doi.org/10.1007/978-3-030-66471-8_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-66471-8_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-66470-1

  • Online ISBN: 978-3-030-66471-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation