A path-based algorithm for evaluating the k-out-of-n flow network reliability

Reliability Engineering and System Safety

Volumn 87, Issue 2, 2005, Pages 243-251

  Yeh, Wei Chang ^a  

^a NATIONAL CHIAYI UNIVERSITY   (Taiwan)

Author keywords

Algorithm; Flow network reliability; K out of n; Minimal path (MP)

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; CONTROL SYSTEMS; POWER TRANSMISSION; PROBABILITY DISTRIBUTIONS; RELIABILITY;

FLOW NETWORK RELIABILITY; K-OUT-OF-N; MINIMAL PATH (MP); PATH-BASED ALGORITHM;

CIRCUIT THEORY;

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

References (37)

1. Samad MA. An efficient algorithm for simultaneously deducing minimal paths as well as cuts of a communication network. Microelectron Reliab 1987;27(3):437-41.
2. Roberts FS, Hwang FK, Monma C. Reliability of computer and communication networks DIMACS series in discrete mathematics and theoretical computer science, vol. 5. Providence, Rhode Island: AMS/ACM publisher; 1991.
3. Ke WJ, Wang SD. Reliability evaluation for distributed computing networks with imperfect nodes. IEEE Trans Reliab 1997;46:342-9.
4. Aven T. Availability evaluation of oil/gas production and transportation systems. Reliab Eng 1987;18:35-44.
5. Aven T. Some considerations on reliability theory and its applications. Reliab Eng Syst Safety 1988;21:215-23.
6. Colbourn CJ. In: The combinatorics of network reliability. New York: Oxford University Press; 1987.
7. Tan Z. Minimal cut sets of s-t networks with k-om-of-n nodes. Reliab Eng Syst Safety 2003/10;82(1):49-54.
8. Yeh WC. A simple algorithm for evaluating the k-out-of-n network reliability. Reliab Eng Syst Safety 2004/1;83(1):93-101.
9. Bellmore M, Jensen PA. An implicit enumeration scheme for proper cut generation. Technometrics 1970;12(4):775-88.
10. Martelli H. A Gaussian elimination algorithm for enumeration of cutsets in a graph. J ACM 1976;23:58-73.
11. Biegel JK. Determination of tie sets and cut sets for a system without feedback. IEEE Trans Reliab 1977;R-26:39-41.
12. Arumkumar S, Lee SH. Enumeration of all minimal cutsets for a node pair in a graph. IEEE Trans Reliab 1979;R-28:51-5.
13. Shier DR, Whiled DE. Algorithms for generating minimal cutsets by inversion. IEEE Trans Reliab 1985;R-34:314-9.
14. Jasmon GB, Foong KW. A method for evaluating all the minimal cuts of a graph. IEEE Trans Reliab 1987;R-36:538-45.
15. Ahmad SH. Simple enumeration of minimal cutsets of acyclic directed graph. IEEE Trans Reliab 1988;R-37:484-7.
16. Elias SS, Mokhles N, Ibrahim SAN. A new technique in a cut set evaluation. Microelectron Reliab 1993;33(9):1351-5.
17. Fard NS, Lee TH. Cutset enumeration of network systems with link and node failures. Reliab Eng Syst Safety 1999;65(2):141-6.
18. Yeh WC. Search for MC in modified networks. Comput Oper Res 2001;28:177-84.
19. Yeh WC. Search for all d-mincuts of a limited-flow network. Comput Oper Res 2002/6;29(13):1843-58.
20. Yeh WC. A simple approach to search for all d-MCS of a limited-flow network. Reliab Eng Syst Safety 2001;71:15-19.
21. Yeh WC. Search for all MCS in networks with unreliable nodes and arcs. Reliab Eng Syst Safety 2003/1;79(1):95-101.
22. Jasmon GB. Cutset analysis of networks using basic minimal paths and network decomposition. IEEE Trans Reliab 1985;R-34:303-7.
23. Yeh WC. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Trans Reliab 1998;7:436-42.
24. Yeh WC. A simple algorithm to search for all d-MPs with unreliable nodes. Reliab Eng Syst Safety 2001;73(1):49-54.
25. Yeh WC. A simple method to verify all d-minimal path candidates of a limited-flow network and its reliability. Int J Adv Manufact Technol 2002;20(1):77-81.
26. Yeh WC. Search for minimal paths in modified networks. Reliab Eng Syst Safety 2002/3;75(3):389-95.
27. Yeh WC. A MCS-RSM approach for the network reliability to minimize the total cost Int J Adv Manufact Technol 2003/11; 22(9-10):681-8.
28. Yeh WC. Multistate-node acyclic network reliability evaluation. Reliab Eng Syst Safety 2002/11;78(2):123-9.
29. Locks MO. Inverting and minimalizing pathsets and cutsets. IEEE Trans Rehab 1978;R-27:107-9.
30. Rai S. comments on: Inverting and minimalizing path sets and cut sets. TFRF Trans Reliab 1979;R-32:263.
31. Rai S, Aggarwal KK. On complementation of pathsets and cutsets. IEEE Trans Reliab 1980;R-29:139-40.
32. Heidtmann KD. Inverting paths and cuts of 2-state systems. IEEE Trans Reliab 1983;R-32:469-71.
33. Jasmon GB, Kai OS. A new technique in minimal path and cutest evaluation. IEEE Trans Reliab 1985;R-34:136-41.
34. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectron Rehab 1995;35(6):973-6.
35. Malinowski J, Preuss W. Reliability evaluation for tree-structured systems with multistate components. Microelectron Reliab 1996;36:9-17.
36. Lee DW, Yum BJ. Determination of minimal upper paths for reliability analysis of planar flow networks. Reliab Eng Syst Safety 1993;39:1-10.
37. Nahman JM. MPs and cuts or networks exposed to common-cause failures. IEEE Trans Reliab 1992;R-41:76-80 see also p. 84.