Reliability Evaluation of a Flow Network
- 1 April 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. R-29 (1) , 24-26
- https://doi.org/10.1109/tr.1980.5220695
Abstract
This paper presents a method for evaluating reliability of a flow network using the concept of lexicographic ordering. Associated with each branch of the network are the flow capacity and the probability that the branch functions properly. The network is successful if a specified units of flow can be transmitted through the network. A labeling scheme is used to route the flow through the network and a computer program for implementing the algorithm is given in the Supplement.Keywords
This publication has 16 references indexed in Scilit:
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex NetworksIEEE Transactions on Reliability, 1978
- Reduced State Enumeration?Another Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1978
- Calculating the Probability of Boolean Expression Being 1IEEE Transactions on Reliability, 1977
- A New Algorithm for Symbolic System Reliability AnalysisIEEE Transactions on Reliability, 1976
- A Fast Algorithm for Reliability EvaluationIEEE Transactions on Reliability, 1975
- Exact calculation of computer network reliabilityNetworks, 1974
- A new method for system reliability evaluationMicroelectronics Reliability, 1973
- Analysis and Design of Reliable Computer NetworksIEEE Transactions on Communications, 1972
- Transportation networks with random arc capacitiesRevue française d'automatique, informatique, recherche opérationnelle. Recherche opérationnelle, 1972
- The generalized simplex method for minimizing a linear form under linear inequality restraintsPacific Journal of Mathematics, 1955