Using minimal cuts to study the system capacity for a stochastic-flow network in two-commodity case

Computers and Operations Research

Volumn 30, Issue 11, 2003, Pages 1595-1607

  Lin, Yi Kuei ^a  

^a VAN NUNG INSTITUTE OF TECHNOLOGY   (Taiwan)

Author keywords

Minimal cuts; Performance index; Stochastic flow network; System capacity; Two commodity

Indexed keywords

ALGORITHMS; PERFORMANCE; PROBABILITY; RANDOM PROCESSES; VECTORS;

SYSTEM CAPACITY;

COMPUTER NETWORKS;

COMMODITY; FLOW; OPERATIONS TECHNOLOGY;

EID: 0037791894     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(02)00094-1     Document Type: Article

References (19)

1. Alexopoulos C. A Note on state-space decomposition methods for analyzing stochastic flow networks. IEEE Transactions on Reliability 1995;44:354-7.
2. Al-Ghanim AM. A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering 1999;36:45-55.
3. Aven T. Reliability evaluation of multistate systems with multistate components. IEEE Transactions on Reliability 1985;34:473-9.
4. Ford LR, Fulkerson DR. Flows in networks. Princeton, NJ: Princeton University Press, 1962.
5. Griffith WS. Multistate reliability models. Journal of Applied Probability 1980;17:735-44.
6. Hudson JC, Kapur KC. Reliability bounds for multistate systems with multistate components. Operations Research 1985;33:153-60.
7. Jane CC, Lin JS, Yuan J. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability 1993;42(3):354-61.
8. Lin JS, Jane CC, Yuan J. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 1995;25(3):131-8.
9. Lin JS. Reliability evaluation of capacitated-flow networks with budget constraints. IIE Transactions 1998;30(12):1175-80.
10. Lin YK, Yuan J. A new algorithm to generate d-minimal paths in a multistate flow network with non-integer arc capacities. International Journal of Reliability, Quality and Safety Engineering 1998;5:269-85.
11. Lin YK. On reliability evaluation of a stochastic-flow network in terms of minimal cuts. Journal of Chinese Institute of Industrial Engineers 2001;18(3):49-54.
12. Lin YK. Study on the multicommodity reliability of a capacitated-flow network. Computers and Mathematics with Applications 2001;42(2):255-64.
13. Lin YK. A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research 2001;28(13):1277-85.
14. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability 1995;35:973-6.
15. Xue J. On multistate system analysis. IEEE Transactions on Reliability 1985;34:329-37.
16. Yarlagadda R, Hershey J. Fast algorithm for computing the reliability of communication network. International Journal of Electronics 1991;70:549-64.
17. Yeh WC. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability 1998;47:436-42.
18. Yeh WC. A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering and System Safety 2001;73:49-54.
19. Yeh WC. A simple approach to search for all d-MCs of a limited-flow network reliability. Engineering and System Safety 2001;71:15-9.