A Boolean algebra method for computing the terminal reliability in a communication network
Authors:
- L. FrattaLFL. Fratta
- U. MontanariUMU. Montanari
- 1 May 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 20 (3) , 203-211
Abstract
Given the set of all simple paths between two nodes in a network, the terminal reliability can be symbolically computed by transforming a Boolean sum of products into an equivalent form in which all terms are disjoint. This new approach seems to be promising in respect to existing 4[ 6 methods both for the exact and for the approximate computation of the terminal reliability.Keywords
This publication has 10 references indexed in Scilit:
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972
- A Computerized Algorithm for Determining the Reliability of Redundant ConfigurationsIEEE Transactions on Reliability, 1971
- Network reliability analysis: Part INetworks, 1971
- Analysis and Design of Survivable NetworksIEEE Transactions on Communications, 1970
- A Computer Program for Approximating System ReliabilityIEEE Transactions on Reliability, 1970
- Reliability Analysis of Redundant Networks Using Flow GraphsIEEE Transactions on Reliability, 1970
- On finding the simple paths and circuits in a graphIEEE Transactions on Circuit Theory, 1968
- All paths through a mazeProceedings of the IEEE, 1967
- Analysis of Probabilistic NetworksIEEE Transactions on Communications, 1964
- Analysis of Switching NetworksBell System Technical Journal, 1955