Constrained shortest link-disjoint paths selection: A network programming based approach

IEEE Transactions on Circuits and Systems I: Regular Papers

Volumn 53, Issue 5, 2006, Pages 1174-1187

  Xiao, Ying ^a   Thulasiraman, Krishnaiyan ^b   Xue, Guoliang ^c  

^a Packet Design Inc   (United States)

^b UNIVERSITY OF OKLAHOMA   (United States)

^c ARIZONA STATE UNIVERSITY   (United States)

Author keywords

Combinatorial optimization; Constrained shortest paths (CSP); Graph theory; Linear programming; Link disjoint paths; Network optimization; QoS routing

Indexed keywords

COMPUTER SIMULATION; INTEGER PROGRAMMING; LINEAR PROGRAMMING; OPTIMIZATION; ROUTERS; TELECOMMUNICATION LINKS;

COMBINATORIAL OPTIMIZATION; CONSTRAINED SHORTEST PATHS (CSP); LINK-DISJOINT PATHS; NETWORK OPTIMIZATION; NETWORK PROGRAMMING; QUALITY OF SERVICE ROUTING;

QUALITY OF SERVICE;

EID: 33646506349     PISSN: 10577122     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCSI.2006.869907     Document Type: Article

References (25)

1. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
2. Z. Wang and J. Crowcroft, "Quality-of-service routing for supporting multimedia applications," IEEE J. Sel. Areas Commun., vol. 14, no. 7, pp. 1228-1234, Jul. 1996.
3. R. Hassin, "Approximation schemes for the restricted shortest path problem," Math. Oper Res., vol. 17, no. 1, pp. 36-42, 1992.
4. C. A. Phillips, "The network inhibition problem," in STOC, 1993, pp. 776-785.
5. D. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest paths problem," Oper. Res. Lett., vol. 28, pp. 213-219, 2001.
6. G. Luo, K. Huang, J. Wang, C. Hobbs, and E. Munter, "Multi-qos constraints based routing for ip and atm networks," in Proc. IEEE Workshop on QoS Support for Real-Time Internet Applications, 1999.
7. R. Ravindran, K. Thulasiraman, A. Das, K. Huang, G. Luo, and G. Xue, "Quality of services routing: Heuristics and approximation schemes with a comparative evaluation," in Proc. ISCAS, 2002, pp. 775-778.
8. G. Handler and I. Zang, "A dual algorithm for the constrained shortest path problem," Networks, vol. 10, pp. 293-310, 1980.
9. K. Mehlhorn and M. Ziegelmann, "Resource constrained shortest paths," in Proc. ESA, 2000, pp. 326-337.
10. A. Jüttner, B. Szviatovszki, I. Mécs, and Z. Rajkó, "Lagrange relaxation based method for the QoS routing problem," in Proc. INFOCOM, 2001, pp. 859-868.
11. B. Blokh and G. Gutin, "An approximation algorithm for combinatorial optimization problems with two parameters," Austr. J. Combinatorics, vol. 14, pp. 157-164, 1996.
12. Y. Xiao, K. Thulasiraman, and G. Xue, "Equivalence, unification and generality of two approaches to the constrained shortest path problem with extension," in Proc. Allerton Conf. Control, Commun. Comp., University of Illinois, 2003, pp. 905-914.
13. A. Jüttner, "On resource constrained optimization problems,", to be published.
14. Y. Xiao, K. Thulasiraman, and G. Xue, "The primal simplex approach to the QoS routing problem," in Proc. QSHINE, 2004, pp. 120-129.
15. A. Orda and A. Sprintson, "Efficient algorithms for computing disjoint QoS paths," in Proc. INFOCOM, 2004, pp. 727-738.
16. J. W. Suurballe, "Disjoint paths in a network," Networks, vol. 4, no. 2, pp. 125-145, 1974.
17. C.-L. Li, T. S. McCormick, and D. Simich-Levi, "The complexity of finding two disjoint paths with min-max objective function," Discr. Appl. Math., vol. 26, no. 1, pp. 105-115, 1990.
18. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge University Press, 2003.
19. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Networks Flows. Englewood Cliffs, NJ: Prentice-Hall, 1993.
20. R. P. Bertsekas and J. N. Tsitsiklis, Introduction to Linear Optimization. Belmont, MA: Athena Scientific, 1997.
21. K. Thulasiraman and M. N. Swamy, Graphs: Theory and Algorithms. New York: Wiley Interscience, 1992.
22. V. Chvatal, "A greedy heuristic for the set covering problem," Math. Oper. Res., vol. 4, no. 3, pp. 233-235, 1979.
23. D. P. Bertsekas, Network Optimization: Continuous and Discrete Models. Belmont, MA: Athena Scientific, 1998.
24. C. R. Palmer and J. G. Steffan, "Generating network topologies that obey power laws," in Proc. IEEE GLOBECOM, 2000, pp. 434-438.
25. B. M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas Commun., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.