A practical algorithm for computing multi-state two-terminal reliability

IEEE Transactions on Reliability

Volumn 57, Issue 2, 2008, Pages 295-302

  Jane, Chin Chia ^a   Laih, Yih Wenn ^a  

^a LING TUNG UNIVERSITY   (Taiwan)

Author keywords

Decomposition algorithm; Maximum flow; Multi state network; Two terminal reliability

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; COMPUTATIONAL METHODS; COMPUTER NETWORKS; EVOLUTIONARY ALGORITHMS; MICROFLUIDICS; NUCLEAR PROPULSION; OPERATIONS RESEARCH; SCHEDULING ALGORITHMS; TELECOMMUNICATION NETWORKS;

COMPUTATIONAL EXPERIMENTS; DECOMPOSITION METHODS; ENUMERATION METHOD; EXACT METHODS; MULTI STATE (MSS); NP HARD PROBLEMS; NP-HARD; REAL-WORLD SYSTEMS; SYSTEM PERFORMANCES; TERMINAL RELIABILITY;

PORT TERMINALS;

EID: 45549107016     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2008.920792     Document Type: Article

References (24)

1. A. H. S. Ang and W. H. Tang, Probability Concepts in Engineering Planning and Design, Vol. II - Decision, Risk, and Reliability. New York: John Wiley & Sons, 1990.
2. M. O. Ball, "Computing network reliability," Operations Research vol. 27, pp. 823-838, 1979.
3. C. J. Colbourn, The Combinatorics of Network Reliability. New York: Oxford University Press, 1987.
4. S. Kuo, S. Lu, and F. Yeh, "Determining terminal pair reliability based on edge expansion diagrams using OBDD," IEEE Trans. Reliability, vol. 48, pp. 234-246, 1999.
5. M. O. Ball, J. Hagstrom, and J. S. Provan, "Threshold reliability of networks with small failure sets," Networks, vol. 25, pp. 101-115, 1995.
6. C.-C. Jane and Y.-W. Laih, "Algorithms to determine the threshold reliability of flow networks," IIE Trans., vol. 36, pp. 469-479, 2004.
7. C.-C. Jane and J. Yuan, "A sum of disjoint products algorithm for reliability evaluation of flow networks," European Journal of Operational Research, vol. 131, pp. 664-675, 2001.
8. W. J. Rueger, "Reliability analysis of networks with capacity constraints and failure at branches & nodes," IEEE Trans. Reliability, vol. 35, pp. 523-528, 1986.
9. S. Soh and S. Rai, "An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities," IEEE Trans. Reliability, vol. 54, pp. 133-144, 2005.
10. C. Alexopoulos, "Note on state-space decomposition methods for analyzing stochastic flow networks," IEEE Trans. Reliability, vol. 44, pp. 354-357, 1995.
11. A. Aven, "Reliability evaluation of multistate systems with multistate components," IEEE Trans. Reliability, vol. 34, pp. 473-479, 1985.
12. P. Doulliez and E. Jamoulle, "Transportation networks with random arc capacities," RAIRO, vol. 3, pp. 45-60, 1972.
13. C.-C. Jane, J.-S. Lin, and J. Yuan, "On reliability evaluation of a limited-flow network in terms of minimal cutsets," IEEE Trans. Reliability, vol. 42, pp. 354-361, 1993.
14. J.-S. Lin, C.-C. Jane, and J. Yuan, "On reliability evaluation of a capacitated-flow network in terms of minimal pathsets," Networks, vol. 25, pp. 131-138, 1995.
15. S. Patra and B. Misra, "Evaluation of probability mass function of flow ni a communication network considering a multistate model of network links," Microelectron Reliability, vol. 36, pp. 415-421, 1996.
16. J. E. Ramirez-Marquez and D. W. Coit, "A Monte-Carlo simulation approach for approximating multi-state two-terminal reliability," Reliability Engineering & System Safety, vol. 87, pp. 253-264, 2005.
17. C. M. Rocco and S. M. Muselli, "Approximate multi-state reliability expressions using a new machine learning technique," Reliability Engineering & System Safety, vol. 89, pp. 261-270, 2005.
18. W. C. Yeh, "A novel method for the network reliability in terms of capacitated-minimum-paths without knowing minimum-paths in advance," Journal Operational Research Society, vol. 56, pp. 1235-1240, 2005.
19. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton: Princeton University Press, 1962.
20. C.-C. Jane, "Viewpoints: A novel method for the network reliability in terms of capacitated- minimum-paths without knowing minimum-paths in advance," Journal Operational Research Society, vol. 58, p. 1394, 2007.
21. W. C. Yeh, "Reply to Jane," Journal Operational Research Society vol. 58, p. 1395, 2007.
22. R. K. Ahuja, M. Kodialam, A. K. Mishra, and J. B. Orlin, "Computational investigations of maximum flow algorithms," European Journal of Operational Research, vol. 97, pp. 509-542, 1997.
23. R. E. Tarjan, Data Structures and Network Algorithms. Philadelphia: Society of Industrial and Applied Mathematics, 1983.
24. D. Klingman, A. Napier, and J. Stutz, "NETGEN: A program for generating large scale capacitated assignment, transportation and minimum cost flow network problems," Management Science, vol. 20, pp. 814-821, 1974.