Skip to main content
SpringerLink
Log in

On Polynomial Bounds of Convergence for the Availability Factor

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

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 601))

Abstract

A computable estimate of the readiness coefficient for a standard binary-state system is established in the case where both working and repair time distributions possess heavy tails.

Both authors are supported by the RFBR, project No 14-01-00319 A. For the first author the article was prepared within the framework of a subsidy granted to the HSE by the Government of the Russian Federation for the implementation of the Global Competitiveness Program.

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

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Borovkov, A.A.: Stochastic Processes in Queueing Theory. Springer-Verlag, New York (1976)

    Book  MATH  Google Scholar 

  2. Thorisson, H.: Coupling, Stationarity, and Regeneration. Springer, New York (2000)

    Book  MATH  Google Scholar 

  3. Gnedenko, B.V., Kovalenko, I.N.: Introduction to Queueing Theory. Birkhauser, Boston (1989)

    Book  Google Scholar 

  4. Kalashnikov, V.V.: Some properties of piecewise linear Markov processes. Teor. Veroyatnost. i Primenen. 20(3), 571–583 (1975)

    Google Scholar 

  5. Klimov, G.P.: Probability Theory and Mathematical Statistics. Mir Publishers, Moscow (1986)

    MATH  Google Scholar 

  6. Zverkina, G.A.: On some limit theorems following from Smith’s Theorem (2015). arxiv:1509.06178

  7. Lindvall, T.: Lectures on the Coupling Method. Wiley, New York (1992)

    MATH  Google Scholar 

  8. Griffeath, D.: A maximal coupling for Markov chains. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 31(2), 95–106 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  9. Veretennikov, A.: Coupling method for Markov chains under integral Doeblin type condition. Theory Stoch. Process. 8(24(3–4)), 383–390 (2002)

    MathSciNet  MATH  Google Scholar 

  10. Veretennikov, A., Zverkina, G.: On polynomial convergence rate of the availability factor to its stationary value. In: Proceedings of the Eighteenth International Scientific Conference on Distributed Computer and Communication Networks: Control Computation, Communications (DCCN-2015), pp. 168–175. ICS RAS, Moscow (2015)

    Google Scholar 

Download references

Acknowledgments

The authors are grateful to L. G. Afanasieva and V. V. Kozlov for very useful consultations.

Author information

Authors and Affiliations

  1. University of Leeds, Leeds, UK

    Alexander Veretennikov

  2. National Research University Higher School of Economics, Moscow, Russia

    Alexander Veretennikov

  3. Institute for Information Transmission Problems, Moscow, Russia

    Alexander Veretennikov

  4. Moscow State University of Railway Engineering, Moscow, Russia

    Galina Zverkina

Authors
  1. Alexander Veretennikov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Galina Zverkina
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Galina Zverkina .

Editor information

Editors and Affiliations

  1. V.A. Trapeznikov Institute of Control Sc, Russian Academy of Sciences V.A. Trapeznikov Institute of Control Sc, Moscow, Russia

    Vladimir Vishnevsky

  2. V.A. Trapeznikov Inst. of Control Scienc, Russian Academy of Sciences V.A. Trapeznikov Inst. of Control Scienc, Moscow, Russia

    Dmitry Kozyrev

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Veretennikov, A., Zverkina, G. (2016). On Polynomial Bounds of Convergence for the Availability Factor. In: Vishnevsky, V., Kozyrev, D. (eds) Distributed Computer and Communication Networks. DCCN 2015. Communications in Computer and Information Science, vol 601. Springer, Cham. https://doi.org/10.1007/978-3-319-30843-2_37

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-30843-2_37

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-30842-5

  • Online ISBN: 978-3-319-30843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation