DocumentCode
1342648
Title
A Recursive Algorithm For Bounding Network Reliability
Author
Shogan, Andrew W.
Author_Institution
School of Business Administration; 350 Barrows Hall; University of California; Berkeley, CA 94720 USA.
Issue
5
fYear
1977
Firstpage
322
Lastpage
327
Abstract
This paper presents a new recursive algorithm for computing bounds on the reliability of a directed, source-sink network whose arcs either function or fail with known probabilities. The reliability is the probability that a path (consisting only of functioning arcs) exists from the network\´s source to its sink. The algorithm is based on a partitioning of the nodes of the network into subsets S1, S2,..., SP such that all predecessors of a node belonging to Sp(2)\n\n\t\t
Keywords
Art; Computer network reliability; Computer networks; Partitioning algorithms; Programming; Random variables; Reliability engineering; Reliability theory; Software algorithms; Upper bound; Bounds; Network reliability; Recursive algorithm;
fLanguage
English
Journal_Title
Reliability, IEEE Transactions on
Publisher
ieee
ISSN
0018-9529
Type
jour
DOI
10.1109/TR.1977.5220186
Filename
5220186
Link To Document