Spare routing reliability for a stochastic flow network through two minimal paths under budget constraint

IEEE Transactions on Reliability

Volumn 59, Issue 1, 2010, Pages 2-10

  Lin, Yi Kuei ^a  

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

Author keywords

Quickest path; Spare routing; Stochastic flow network

Indexed keywords

BUDGET CONSTRAINT; FLOW NETWORK; MINIMAL PATH; MINIMUM TIME; MULTI STATE; QUICKEST PATH PROBLEM; REAL SYSTEMS; REAL-LIFE SYSTEMS; SOLUTION PROCEDURE; STOCHASTIC FLOW NETWORKS; TRANSMISSION TIME; TRANSPORTATION SYSTEM;

BUDGET CONTROL; RELIABILITY; STOCHASTIC SYSTEMS; TELECOMMUNICATION NETWORKS;

REAL TIME SYSTEMS;

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

References (37)

1. R. K. Ahuja, "Minimum cost-reliability ratio problem," Computers and Operations Research, vol. 16, no. 1, pp. 83-89, 1998.
2. C. Alexopoulos, "A Note on state-space decomposition methods for analyzing stochastic flow networks," IEEE Trans. Reliability, vol. 44, no. 2, pp. 354-357, 1995.
3. A. M. Al-Ghanim, "A heuristic technique for generating minimal paths and cutsets of a general network," Computers and Industrial Engineering, vol. 36, no. 1, pp. 45-55, 1999.
4. T. Aven, "Reliability evaluation of multistate systems with multistate components," IEEE Trans. Reliability, vol. 34, no. 5, pp. 473-479, 1985.
5. L. D. Bodin, B. L. Golden, A. A. Assad, and M. O. Ball, "Routing and scheduling of vehicles and crews: The state of the art," Computers and Operations Research, vol. 10, no. 2, pp. 63-211, 1982.
6. T. B. Brecht and C. J. Colbourn, "Lower bounds on two-terminal network reliability," Discrete Applied Mathematics, vol. 21, no. 3, pp. 185-198, 1988.
7. G. H. Chen and Y. C. Hung, "On the quickest path problem," Information Processing Letters, vol. 46, no. 3, pp. 125-128, 1993.
8. G. H. Chen and Y. C. Hung, "Algorithms for the constrained quickest path problem and the enumeration of quickest paths," Computers and Operations Research, vol. 21, no. 2, pp. 113-118, 1994.
9. Y. L. Chen and Y. H. Chin, "The quickest path problem," Computers and Operations Research, vol. 17, no. 2, pp. 153-161, 1990.
10. Y. L. Chen, "An algorithm for finding the k quickest paths in a network," Computers and Operations Research, vol. 20, no. 1, pp. 59-65, 1993.
11. Y. L. Chen, "Finding the k quickest simples paths in a network," Information Processing Letters, vol. 50, no. 2, pp. 89-92, 1994.
12. Y. L. Chen and K. Tang, "Minimum time paths in a network with mixed time constraints," Computers and Operations Research, vol. 25, no. 10, pp. 793-805, 1998.
13. J. C. N. Clímaco, M. M. B. Pascoal, J. M. F. Craveirinha, and M. E. V. Captivo, "Internet packet routing: Application of a K-quickest path algorithm," European Journal of Operational Research, vol. 181, no. 3, pp. 1045-1054, 2007.
14. M. L. Fredman and R. E. Tarjan, "Fibonacci heaps and their uses in improved network optimization algorithms," J. ACM, vol. 34, no. 3, pp. 596-615, 1987.
15. B. L. Golden and T. L. Magnanti, "Deterministic network optimization: A bibliography," Networks, vol. 7, no. 2, pp. 149-183, 1977.
16. J. C. Hudson and K. C. Kapur, "Reliability bounds for multistate systems with multistate components," Operations Research, vol. 33, no. 1, pp. 153-160, 1985.
17. H. Huang and G. Feng, "Delay-dependent stability for uncertain stochastic neural network with time-varying delay," Physica A: Statistical Mechanics and its Applications, vol. 381, no. 1/2, pp. 93-103, 2007.
18. H. Huang and G. Feng, "Corrigendum to delay-dependent stability for uncertain stochastic neural networks with time-varying delay," Physica A: Statistical Mechanics and its Applications, vol. 387, no. 5/6, pp. 1431-1432, 2008.
19. Y. C. Hung and G. H. Chen, "Distributed algorithms for the quickest path problem," Parallel Computing, vol. 18, no. 7, pp. 823-834, 1992.
20. 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, no. 3, pp. 354-361, 1993.
21. K. Kobayashi and H. Yamamoto, "A new algorithm in enumerating all minimal paths in a sparse network," Reliability Engineering and System Safety, vol. 65, no. 1, pp. 11-15, 1999.
22. D. T. Lee and E. Papadopoulou, "The all-pairs quickest path problem," Information Processing Letters, vol. 45, no. 5, pp. 261-267, 1993.
23. 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, no. 3, pp. 131-138, 1995.
24. Y. K. Lin, "Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network," Computers and Operations Research, vol. 30, no. 4, pp. 567-575, 2003.
25. Y. K. Lin, "Reliability of a stochastic-flow network with unreliable branches & nodes under budget constraints," IEEE Trans. Reliability, vol. 53, no. 3, pp. 381-387, 2004.
26. Y. K. Lin, "Reliability evaluation for an information network with node failure under cost constraint," IEEE Trans. Systems, Man and Cybernetics - Part A: Systems and Humans, vol. 37, no. 2, pp. 180-188, 2007.
27. Y. K. Lin, "On a multicommodity stochastic-flow network with unreliable nodes subject to budget constraint," European Journal of Operational Research, vol. 176, no. 1, pp. 347-360, 2007.
28. E. D. Q. V. Martins and J. L. E. D. Santos, "An algorithm for the quickest path problem," Operations Research Letters, vol. 20, no. 4, pp. 195-198, 1997.
29. C. K. Park, S. Lee, and S. Park, "A label-setting algorithm for finding a quickest path," Computers and Operations Research, vol. 31, no. 1, pp. 2405-2418, 2004.
30. M. M. B. Pascoal, M. E. V. Captivo, and J. C. N. Clímaco, "An algorithm for ranking quickest simple paths," Computers and Operations Research, vol. 32, no. 3, pp. 509-520, 2005.
31. Y. Shen, "A new simple algorithm for enumerating all minimal paths and cuts of a graph," Microelectronics and Reliability, vol. 35, no. 6, pp. 973-976, 1995.
32. Z. Wang, S. Lauria, J. Fang, and X. Liu, "Exponential stability of uncertain stochastic neural networks with mixed time-delays," Chaos, Solitons and Fractals, vol. 32, no. 1, pp. 62-72, 2007.
33. Z. Wang, J. Fang, and X. Liu, "Global stability of stochastic high-order neural networks with discrete and distributed delays," Chaos, Solitons and Fractals, vol. 36, no. 2, pp. 388-396, 2008.
34. J. Xue, "On multistate system analysis," IEEE Trans. Reliability, vol. 34, no. 4, pp. 329-337, 1985.
35. R. Yarlagadda and J. Hershey, "Fast algorithm for computing the reliability of communication network," Int. J. Electronics, vol. 70, no. 3, pp. 549-564, 1991.
36. W. C. Yeh, "Search for minimal paths in modified networks," Reliability Engineering and System Safety, vol. 75, no. 3, pp. 389-395, 2002.
37. W. C. Yeh, "An improved sum-of-disjoint-products technique for the symbolic network reliability analysis with known minimal paths," Reliability Engineering and System Safety, vol. 92, no. 2, pp. 260-268, 2007.