Title :
A Pruned Tree Approach to Reliability Computation
Author_Institution :
IBM Information Network; P.O. Box 30021; Tampa, Florida 33630 USA.
fDate :
6/1/1983 12:00:00 AM
Abstract :
This paper presents a new algorithm for computing network terminal reliability from a set of paths or cut-sets. Topics include the general problem, past approaches, the algorithm of this paper, efficiency comparisons with other methods, and extensions to s-dependent failures. An appendix contains a program listing with comments. The algorithm is based on selective generation of relevant states, via mechanisms for choosing and pruning branches of a binary tree. The method is easy to implement and to understand, and has proved in practice to be more efficient than the fastest methods published heretofore.
Keywords :
Binary trees; Computer networks; Matrix decomposition; Reliability engineering; Reliability theory; Testing; Algorithm; Bayes decomposition; Disjoint states; Network; Recursion; Terminal reliability;
Journal_Title :
Reliability, IEEE Transactions on
DOI :
10.1109/TR.1983.5221519