Fast algorithm for computing the reliability of a communication network
Rao Yarlagadda, John E. Hershey · International Journal of Electronics · 1991
This paper presents a fast algorithm for computing the reliability of a communication network when each link has the same probability of success. The computational complexity of existing algorithms increases exponentially as the number of links increases. Our algorithm is based on combinatorics and we conclude, for the case when links have the same survival probabilities, that the computational complexity grows subexponentially as the number of links increases. Furthermore, the algorithm is mostly algebraic in nature.