Sequential Bounding of the Reliability of a Stochastic Network

Andrew W. Shogan
Additional contact information
Andrew W. Shogan: University of California, Berkeley, California

Operations Research, 1976, vol. 24, issue 6, 1027-1044

Abstract: Given a directed source-sink network whose arcs either function or fail with known probabilities, we define the reliability of a node as the probability that there exists a path from the network's source to the node that consists only of functioning arcs. The concept of the strongly connected components of a network and the theory of associated random variables enable us to develop an algorithm that sequentially computes upper bounds on the reliabilities of nodes of the network until we finally obtain an upper bound on the reliability of the network's sink. The construction of a dual of the stochastic network permits the calculation of a lower bound on the reliability of the sink. These bounds are shown analytically to be tighter than the existing Esary-Proschan bounds.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.6.1027 (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:24:y:1976:i:6:p:1027-1044

Access Statistics for this article

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