Abstract
In this paper, we develop a new method for evaluating the reliability polynomial of a hammock network. The method is based on a homogeneous absorbing Markov chain and provides the exact reliability for networks of width less than 5 and arbitrary length. Moreover, it produces a lower bound for the reliability polynomial for networks of width greater than or equal to 5. To investigate how sharp this lower bound is, we compare our method with other approximation methods and it proves to be the most accurate in terms of absolute as well as relative error. Using the fundamental matrix, we also calculate the average time to absorption, which provides the mean length of a network that is expected to work.
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Two-Terminal Reliability of the K4-Ladder—Revisited;Springer Proceedings in Mathematics & Statistics;2024
2. Asymptotic behaviors of aggregated Markov processes;Probability in the Engineering and Informational Sciences;2023-07-25
3. On the Roots of a Family of Polynomials;Fractal and Fractional;2023-04-19
4. A Tale of Catalan Triangles: Counting Lattice Paths;Soft Computing Applications;2023
5. On the Roots of Certain Reliability Polynomials;Intelligent Methods Systems and Applications in Computing, Communications and Control;2022-09-25