Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes
- 1 December 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Reliability
- Vol. 35 (5) , 523-528
- https://doi.org/10.1109/tr.1986.4335537
Abstract
A new method for reliability analysis of stochastic flow networks is proposed. Nodes as well as branches can have limited capacities and can fail. The method builds a branching tree. The tree-nodes are the disjoint terms of a symbolic reliability expression. The paper shows how to find the probability function and mean of the network performance. The method is both simple and effective. The minimal paths or cutsets are not needed explicitly. On a computer the memory effort is very low #x0005F; it increases only quadratically with the number of failing elements. The method can be modified reasonably for other reliability problems.Keywords
This publication has 6 references indexed in Scilit:
- Modification of cutsets for reliability evaluation of communication systemsMicroelectronics Reliability, 1982
- System-Reliability Evaluation Techniques for Complex/Large SystemsߞA ReviewIEEE Transactions on Reliability, 1981
- Reliability Evaluation of a Flow NetworkIEEE Transactions on Reliability, 1980
- New Topological Formula and Rapid Algorithm for Reliability Analysis of Complex NetworksIEEE Transactions on Reliability, 1978
- Recursive Algorithm for Traffic Distribution Calculation for Certain Unreliable Telephone ExchangesIEEE Transactions on Reliability, 1977
- Reliability evaluation A comparative study of different techniquesMicroelectronics Reliability, 1975