Skip to main content

On Polynomial Bounds of Convergence for the Availability Factor

Part of the Communications in Computer and Information Science book series (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.

Keywords

  • Readiness coefficient
  • Restorable system
  • Heavy tails
  • Polynomial convergence rate

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, access via your institution.

References

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

    CrossRef  Google Scholar 

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

    CrossRef  Google Scholar 

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

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

    MathSciNet  CrossRef  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

Authors

Corresponding author

Correspondence to Galina Zverkina .

Editor information

Editors and Affiliations

Rights and permissions

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

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)