DocumentCode
894544
Title
Reliability Analysis of Networks with Capacity-Constraints and Failures at Branches & Nodes
Author
Rueger, W.J.
Author_Institution
Academy of Sciences, Potsdam
Volume
35
Issue
5
fYear
1986
Firstpage
523
Lastpage
528
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 ¿ it increases only quadratically with the number of failing elements. The method can be modified reasonably for other reliability problems.
Keywords
Computer network reliability; Computer networks; Failure analysis; Flow graphs; Performance analysis; Reliability theory; Stochastic processes; Telecommunication computing; Telecommunication network reliability; Transportation;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/TR.1986.4335537
Filename
4335537
Link To Document