Reliability of a stochastic-flow network with unreliable branches and nodes, under budget constraints

IEEE Transactions on Reliability

Volumn 53, Issue 3, 2004, Pages 381-387

  Lin, Yi Kuei ^a  

^a VANUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; MANAGEMENT INFORMATION SYSTEMS; MATHEMATICAL MODELS; RANDOM PROCESSES; SYSTEMS ANALYSIS;

BUDGET CONSTRAINT; MINIMAL PATH; RELIABILITY EVALUATION; STOCHASTIC FLOW NETWORK; SYSTEM RELIABILITY; UNRELIABLE NODE;

RELIABILITY;

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

References (19)

1. K. K. Aggarwal, Y. C. Chopra, and J. S. Bajwa, "Capacity consideration in reliability analysis of communication systems," IEEE Trans. Rel., vol. 31, pp. 177-180, 1982.
2. A. M. Al-Ghanim, "A heuristic technique for generating minimal paths and cutsets of a general network," Computers and Industrial Engineering, vol. 36, pp. 45-55, 1999.
3. M. O. Ball, "Computational complexity of network reliability analysis: an overview," IEEE Trans. Rel., vol. 35, pp. 230-239, 1986.
4. L. R. Ford and D. R. Fulkerson, Flows in Networks. Princeton, New Jersey: Princeton University Press, 1962.
5. W. S. Griffith, "Multistate reliability models," J. Appl. Prob., vol. 17, pp. 735-744, 1980.
6. J. C. Hudson and K. C. Kapur, "Reliability bounds for multistate systems with multistate components," Oper. Res., vol. 33, pp. 153-160, 1985.
7. K. Kobayashi and H. Yamamoto, "A new algorithm in enumerating all minimal paths in a sparse network," Reliab. Eng. Syst. Saf., vol. 65, pp. 11-15, 1999.
8. D. W. Lee and B. J. Yum, "Determination of minimal upper paths for reliability analysis of planar flow networks," Reliab. Eng. Syst. Saf, vol. 39, pp. 1-10, 1993.
9. S. H. Lee, "Reliability evaluation of a flow network," IEEE Trans. Rel., vol. 29, pp. 24-26, 1980.
10. J. S. Lin, C. C. Jane, and J. Yuan, "On reliability evaluation of a capacitated-flow network in terms of minimal pathsets," Network, vol. 25, pp. 131-138, 1995.
11. Y. K. Lin, "On reliability evaluation of a stochastic-flow network in terras of minimal cuts," Journal of Chinese Institute of Industrial Engineers, vol. 18, pp. 49-54, 2001.
12. Y. K. Lin, "Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs," Reliab. Eng. Syst. Saf., vol. 75, pp. 41-46, 2002.
13. S. M. Ross, Introduction to Probability Models: Academic Press, 1993.
14. W. J. Rueger, "Reliability analysis of networks with capacity-constraints and failures at branches and nodes," IEEE Trans. Rel., vol. 35, pp. 523-528, 1986.
15. Y. Shen, "A new simple algorithm for enumerating all minimal paths and cuts of a graph," Microelectron. Reliab., vol. 35, pp. 973-976, 1995.
16. S. Soh and S. Rai, "CAREL: computer aided reliability evaluation for distributed computing networks," IEEE Trans. Parallel & Distributed Systems, vol. 2, pp. 199-213, 1991.
17. J. Xue, "On multistate system analysis," IEEE Trans. Rel., vol. 34, pp. 329-337, 1985.
18. W. C. Yeh, "A revised layered-network algorithm to search for all d-min-paths of a limited-flow acyclic network," IEEE Trans. Rel., vol. 47, pp. 436-442, 1998.
19. W. C. Yeh, "A simple algorithm to search for all d-MP's with unreliable nodes," Reliab. Eng. Syst. Saf, vol. 73, pp. 49-54, 2001.