Optimal routing policy of a stochastic-flow network

Computers and Industrial Engineering

Volumn 56, Issue 4, 2009, Pages 1414-1418

  Lin, Yi Kuei ^a  

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

Author keywords

Optimal; Quickest path; Routing policy; Stochastic flow network; System reliability

Indexed keywords

OPTIMAL; QUICKEST PATH; ROUTING POLICY; STOCHASTIC-FLOW NETWORK; SYSTEM RELIABILITY;

CAVITY RESONATORS; OPTIMIZATION; RANDOM PROCESSES; RELIABILITY; ROUTING ALGORITHMS;

COMPUTER NETWORKS;

EID: 67349121583     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2008.09.002     Document Type: Article

References (28)

1. Ahuja R.K. Minimum cost-reliability ratio problem. Computers and Operations Research 16 (1988) 83-89
2. 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
3. Bodin L.D., Golden B.L., Assad A.A., and Ball M.O. Routing and scheduling of vehicles and crews: The state of the art. Computers and Operations Research 10 (1982) 63-211
4. Chen G.H., and Hung Y.C. On the quickest path problem. Information Processing Letters 46 (1993) 125-128
5. Chen G.H., and Hung Y.C. Algorithms for the constrained quickest path problem and the enumeration of quickest paths. Computers and Operations Research 21 (1994) 113-118
6. Chen Y.L. An algorithm for finding the k quickest paths in a network. Computers and Operations Research 20 (1993) 59-65
7. Chen Y.L. Finding the k quickest simples paths in a network. Information Processing Letters 50 (1994) 89-92
8. Chen Y.L., and Chin Y.H. The quickest path problem. Computers and Operations Research 17 (1990) 153-161
9. Chen Y.L., and Tang K. Minimum time paths in a network with mixed time constraints. Computers and Operations Research 25 10 (1998) 793-805
10. Clímaco J.C.N., Pascoal M.M.B., Craveirinha J.M.F., and Captivo M.E.V. Internet packet routing: application of a K-quickest path algorithm. European Journal of Operational Research 181 3 (2007) 1045-1054
11. Fredman M.L., and Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of ACM 34 (1987) 596-615
12. Golden B.L., and Magnanti T.L. Deterministic network optimization: A bibliography. Networks 7 (1977) 149-183
13. Hung Y.C., and Chen G.H. Distributed algorithms for the quickest path problem. Parallel Computing 18 (1992) 823-834
14. 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
15. 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
16. Lee D.T., and Papadopoulou E. The all-pairs quickest path problem. Information Processing Letters 45 (1993) 261-267
17. 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
18. Lin Y.K. Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network. Computers and Operations Research 30 4 (2003) 567-575
19. Lin Y.K. Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints. IEEE Transactions on Reliability 53 (2004) 381-387
20. 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 2 (2007) 180-188
21. Lin Y.K. On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint. European Journal of Operational Research 176 (2007) 347-360
22. Martins E.D.Q.V., and Santos J.L.E.D. An algorithm for the quickest path problem. Operations Research Letters 20 (1997) 195-198
23. Park C.K., Lee S., and Park S. A label-setting algorithm for finding a quickest path. Computers and Operations Research 31 14 (2004) 2405-2418
24. Shen Y. A new simple algorithm for enumerating all minimal paths and cuts of a graph. Microelectronics and Reliability 35 (1995) 973-976
25. Xue J. On multistate system analysis. IEEE Transactions on Reliability 34 (1985) 329-337
26. Yeh W.C. Search for minimal paths in modified networks. Reliability Engineering and System Safety 75 3 (2002) 389-395
27. Yeh W.C. An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths. Reliability Engineering and System Safety 92 (2007) 260-268
28. Yeh W.C. A simple minimal path method for estimating the weighted multi-commodity multistate unreliable networks reliability. Reliability Engineering and System Safety 93 (2008) 125-136