A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes

Reliability Engineering and System Safety

Volumn 83, Issue 1, 2004, Pages 47-55

  Yeh, Weiwe Chang ^a  

^a FENG CHIA UNIVERSITY   (Taiwan)

Author keywords

Max flow; MC d MC; Node failure; Reliability; Stochastic flow Network

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

STOCHASTIC-FLOW NETWORKS;

RELIABILITY THEORY;

EID: 0242691800     PISSN: 09518320     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ress.2003.08.007     Document Type: Article

References (23)

1. Aven T. Availability evaluation of oil/gas production and transportation systems. Reliab Engng. 18:1987;35-44.
2. Hudson J.C., Kapur K.C. Reliability bounds for multistate systems with multistate components. Oper Res. 33:1985;153-160.
3. Aven T. Reliability evaluation of multistate systems with multistate components. IEEE Transact Reliab. R-34:1985;473-479.
4. Lee S.H. Reliability evaluation of a flow network. IEEE Transactions on Reliability. R-29:1980;21-26.
5. Aggarwal K.K., , et al. A simple method for reliability evaluation of a communication system. IEEE Transact Commun. COM-23:1975;563-565.
6. Samad M.A. An efficient algorithm for simultaneously deducing MPs as well as cuts of a communication network. Microelectron Reliab. 27:1987;437-441.
7. Ke W.J., Wang S.D. Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Transact Reliab. 46:1997;342-349.
8. Doulliez P., Jalnoulle E. Transportation network with random arc capacities, RAIRO, Rech. Oper Res. 3:1972;45-60.
9. Colbourn C.J. The combinatorics of network reliability. 1987;Oxford University Press, New York.
10. Yeh W.C. A simple algorithm to search for all d-MPs with unreliable nodes. Reliab Engng Syst Safety. 73:(1):2001;49-54.
11. Yeh W.C. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transact Reliab. 47:1998;436-442.
12. Yeh W.C. A simple method to verify all d-MP candidates of a limited-flow network. Int J Adv Manuf Technol. 20:(1):2002;77-81.
13. Xue J. On multistate system analysis. IEEE Trans Reliab. R-34:1985;329-337.
14. Jane C.C., Lin J.S., Yuan J. Reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transact Reliab. R-42:1993;354-361.
15. Yeh W.C. Search for all d-Mincuts of a limited-flow network. Comput Oper Res. 29:(13):2002;1843-1858.
16. Yeh W.C. Search for MC in modified networks. Comput Oper Res. 28:(2):2001;177-184.
17. Yeh W.C. A simple approach to search for all d-MCs of a limited-flow network. Reliab Engng Syst Safety. 71:(2):2001;15-19.
18. Xue J. New approach for multistate systems analysis. Reliab Engng. 10:1985;245-256.
19. Yeh W.C. A new approach to the d-MC problem. Relia Engng Syst Safety. 77:(2):2002;201-206.
20. Malinowski J., Preuss W. A parallel algorithm evaluating the reliability of a system with known minimal cuts (paths). Microelectron Reliab. 37:(2):1997;255-265.
21. Lin Y.K. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliab Engng Syst Safety. 75:(1):2002;41-46.
22. Karger D.R., Stein C. A new approach to the minimum cut problem. J ACM. 43:(4):1996;601-640.
23. Allan R.N., Rondiris I.L., Fryer D.M. An efficient computational technique for evaluating the cut/tie and common cause failures of complex systems. IEEE Transact Reliab. R-30:1981;101-109.