An Improved Algorithm for Network Reliability
- 1 April 1979
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-28 (1) , 58-61
- https://doi.org/10.1109/tr.1979.5220476
Abstract
Boolean algebra has been used to find the probability of communication between a pair of nodes in a network by starting with a Boolean product corresponding to simple paths between the pair of nodes and making them disjoint (mutually exclusive). A theorem is given, the use of which enables the disjoint products to be found much faster than by existing methods. An algorithm and results of its implementation on a computer are given. Comparisons with existing methods show the usefulness of the algorithm for large networks.Keywords
This publication has 7 references indexed in Scilit:
- Calculating the Probability of Boolean Expression Being 1IEEE Transactions on Reliability, 1977
- Comments on "On the Analysis of Fault TreesIEEE Transactions on Reliability, 1976
- A New Algorithm for Symbolic System Reliability AnalysisIEEE Transactions on Reliability, 1976
- On the Analysis of Fault TreesIEEE Transactions on Reliability, 1975
- A Simple Method for Reliability Evaluation of a Communication SystemIEEE Transactions on Communications, 1975
- A Fast Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1975
- A Boolean algebra method for computing the terminal reliability in a communication networkIEEE Transactions on Circuit Theory, 1973