On Polynomial Bounds of Convergence for the Availability Factor

DOI10.1007/978-3-319-30843-2_37MaRDI QIDQ4568367zbMATHOpenAlexFDO

Authors A. Yu. Veretennikov, Galina Zverkina

Publication date 21 June 2018

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1512.01275

zbMATH Keywords

heavy tailspolynomial convergence raterestorable systemreadiness coefficient

Mathematics Subject Classification ID

Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Queueing theory (aspects of probability theory) (60K25)

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.

Cites work

• scientific article; zbMATH DE number 4076144 (Why is no real title available?)
• scientific article; zbMATH DE number 51480 (Why is no real title available?)
• scientific article; zbMATH DE number 3500818 (Why is no real title available?)
• scientific article; zbMATH DE number 1995728 (Why is no real title available?)
• scientific article; zbMATH DE number 837692 (Why is no real title available?)
• scientific article; zbMATH DE number 1416816 (Why is no real title available?)
• A maximal coupling for Markov chains
• Certain Properties of Piecewise-Linear Markov Processes

Cited in

(1)

• On strong bounds of rate of convergence for regenerative processes

This page was built for publication: On Polynomial Bounds of Convergence for the Availability Factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568367)