Computation of the Reliability of a Stochastic Network.
STANFORD UNIV CALIF DEPT OF OPERATIONS RESEARCH
Pagination or Media Count:
Given a directed network whose arcs either function or fail with known probabilities, define the reliability of a node as the probability that there exists a path from the networks source to the node composed only of functioning arcs. An algorithm is presented that recursively computes the reliabilities of nodes of the network until the reliability of the sink is obtained. Furthermore, algorithms are presented to recursively bound the reliabilities of nodes until upper and lower bounds on the reliability of the sink are obtained. These bounds are shown analytically to be tighter than the existing Esary-Proschan bounds. Author
- Operations Research
- Manufacturing and Industrial Engineering and Control of Production Systems