Two-commodity reliability evaluation of a stochastic-flow network with varying capacity weight in terms of minimal paths

Computers and Operations Research

Volumn 36, Issue 4, 2009, Pages 1050-1063

  Lin, Yi Kuei ^a  

^a NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Capacity weight; Cost attribute; Minimal paths; Stochastic flow network; System reliability; Two commodity

Indexed keywords

DECISION MAKING; NETWORK PROTOCOLS; PROBLEM SOLVING; SENSOR NETWORKS; STOCHASTIC MODELS; STOCHASTIC PROGRAMMING;

CAPACITY WEIGHT; MINIMAL PATHS; STOCHASTIC-FLOW NETWORK; SYSTEM RELIABILITY; TWO-COMMODITY;

RELIABILITY;

EID: 54449083627     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2007.12.005     Document Type: Article

References (37)

1. Abraham J.A. An improved algorithm for network reliability. IEEE Transactions on Reliability 28 (1979) 58-61
2. Yarlagadda R., and Hershey J. Fast algorithm for computing the reliability of communication network. International Journal of Electronics 70 (1991) 549-564
3. Aggarwal K.K., Gupta J.S., and Misra K.B. A simple method for reliability evaluation of a communication system. IEEE Transactions on Communications 23 (1975) 563-565
4. Colbourn C.J. The combinatorics of network reliability (1987), Oxford University Press, New York
5. Aggarwal K.K., Chopra Y.C., and Bajwa J.S. Capacity consideration in reliability analysis of communication systems. IEEE Transactions on Reliability 31 (1982) 177-180
6. Lee S.H. Reliability evaluation of a flow network. IEEE Transactions on Reliability 29 (1980) 24-26
7. Ford L.R., and Fulkerson D.R. Flows in networks (1962), Princeton University Press, Princeton
8. Lin J.S., Jane C.C., and Yuan J. On reliability evaluation of a capacitated-flow network in terms of minimal pathsets. Networks 25 (1995) 131-138
9. Xue J. On multistate system analysis. IEEE Transactions on Reliability 34 (1985) 329-337
10. Yeh W.C. A revised layered-network algorithm to search for all d-minpaths of a limited-flow acyclic network. IEEE Transactions on Reliability 47 (1998) 436-442
11. Doulliez P., and Jamoulle J. Transportation networks with random arc capacities. RAIRO-Operations Research 3 (1972) 45-60
12. Lin Y.K. A simple algorithm for reliability evaluation of a stochastic-flow network with node failure. Computers and Operations Research 28 (2001) 1277-1285
13. Yeh W.C. A simple algorithm to search for all d-MPs with unreliable nodes. Reliability Engineering & System Safety 73 (2001) 49-54
14. Yeh W.C. A new approach to evaluate reliability of multistate networks under the cost constraint. Omega 33 (2005) 203-209
15. Jane C.C., Lin J.S., and Yuan J. On reliability evaluation of a limited-flow network in terms of minimal cutsets. IEEE Transactions on Reliability 42 (1993) 354-361
16. Lin Y.K. On reliability evaluation of a stochastic-flow network in terms of minimal cuts. Journal of Chinese Institute of Industrial Engineers 18 (2001) 49-54
17. Soh S., and Rai S. An efficient cutset approach for evaluating communication-network reliability with heterogeneous link-capacities. IEEE Transactions on Reliability 54 (2005) 133-144
18. Yeh W.C. A simple approach to search for all d-MCs of a limited-flow network. Reliability Engineering & System Safety 71 (2001) 15-19
19. Evans J.R. Maximal flow in probabilistic graphs-the discrete case. Networks 6 (1976) 161-183
20. Assad A.A. Multicommodity network flows-a survey. Networks 8 (1978) 37-91
21. Ford L.R., and Fulkerson D.R. A suggested computation for maximal multicommodity network flows. Management Science 20 (1974) 822-844
22. Held M., Wolfe P., and Crowder H.P. Validation of subgradient optimization. Mathematical Programming 6 (1974) 62-88
23. Hu T.C. Multi-commodity network flows. Operations Research 11 (1963) 344-360
24. Jarvis J.J. On the equivalence between the node-arc and arc-chain formulations for the multi-commodity maximal flow problem. Naval Research Logistics Quarterly 16 (1969) 525-529
25. Rothechild B., and Whinston A. On two commodity network flows. Operations Research 14 (1966) 377-387
26. Lin Y.K. Study on the multicommodity reliability of a capacitated-flow network. Computers & Mathematics with Applications 42 (2001) 255-264
27. Griffith W.S. Multistate reliability models. Journal of Applied Probability 17 (1980) 735-744
28. Hudson J.C., and Kapur K.C. Reliability bounds for multistate systems with multistate components. Operations Research 33 (1985) 153-160
29. Lin Y.K. Using minimal cuts to evaluate the system reliability of a stochastic-flow network with failures at nodes and arcs. Reliability Engineering System Safety 75 (2002) 41-46
30. Lin Y.K. Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability 53 (2004) 381-387
31. Lin Y.K. Reliability evaluation for an information network with node failure under cost constraint. IEEE Transactions on Systems, Man and Cybernetics-Part A: Systems and Humans 37 (2007) 180-188
32. Yeh W.C. A simple MC-based algorithm for evaluating reliability of stochastic-flow network with unreliable nodes. Reliability Engineering & System Safety 83 (2004) 47-55
33. Lin J.S. Reliability evaluation of capacitated-flow networks with budget constraints. IIE Transactions 30 (1998) 1175-1180
34. Al-Ghanim A.M. A heuristic technique for generating minimal paths and cutsets of a general network. Computers and Industrial Engineering 36 (1999) 45-55
35. Kobayashi K., and Yamamoto H. A new algorithm in enumerating all minimal paths in a sparse network. Reliability Engineering and System Safety 65 (1999) 11-15
36. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability 35 (1995) 973-976
37. Soh S., and Rai S. CAREL: computer aided reliability evaluation for distributed computing networks. IEEE Transactions on Parallel & Distributed Systems 2 (1991) 199-213