Computing Network Reliability

Michael O. Ball
Additional contact information
Michael O. Ball: University of Maryland, College Park, Maryland

Operations Research, 1979, vol. 27, issue 4, 823-838

Abstract: This paper presents an algorithm to compute reliability measures on a stochastic network in which both nodes and links can fail. The measures considered are the probability that nodes s and t can communicate for all node pairs s and t , the probability that all operative node pairs can communicate, and the expected number of node pairs communicating. It also computes the latter two measures when all communication must proceed through a root node. A specialized version of the algorithm is given for networks in which only nodes can fail.

Date: 1979
References: Add references at CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.27.4.823 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:27:y:1979:i:4:p:823-838

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().