Polynomial time approximation algorithms for multi-constrained QoS routing

IEEE/ACM Transactions on Networking

Volumn 16, Issue 3, 2008, Pages 656-669

  Xue, Guoliang ^a   Zhang, Weiyi ^b   Tang, Jian ^c   Thulasiraman, Krishnaiyan ^d  

^a Arizona State University   (United States)

^b North Dakota State University   (United States)

^c Montana State University   (United States)

^d University of Oklahoma   (United States)

Author keywords

Efficient approximation algorithms; Multiple additive constraints; Quality of service (QoS) routing

Indexed keywords

AEROSPACE APPLICATIONS; ALGORITHMS; APPROXIMATION THEORY; CHEMICAL MODIFICATION; COMPUTER NETWORKS; CONSTRAINED OPTIMIZATION; EVOLUTIONARY ALGORITHMS; FOOD ADDITIVES; INTEGER PROGRAMMING; MICROFLUIDICS; NUCLEAR PROPULSION; POLYNOMIAL APPROXIMATION; POLYNOMIALS; QUALITY OF SERVICE; ROUTING ALGORITHMS; TREES (MATHEMATICS);

END-TO-END QOS; NP-HARD; POLYNOMIAL-TIME; POLYNOMIAL-TIME APPROXIMATION ALGORITHMS; QOS ROUTING; QUALITY OF SERVICE (QOS) PARAMETERS; QUALITY OF SERVICE (QOS) ROUTING;

APPROXIMATION ALGORITHMS;

EID: 45749119528     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2007.900712     Document Type: Article

References (32)

1. R. Andersen, F. Chung, A. Sen, and G. Xue, "On disjoint path pairs with wavelength continuity constraint in WDM networks," in Proc. IEEE INFOCOM, 2004, pp. 524-535.
2. BRITEE. [Online]. Available: http://www.cs.bu.edu/brite/
3. S. Chen and K. Nahrstedt, "On finding multi-constrained paths," in Proc. IEEE ICC, 1998, pp. 874-879.
4. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 2nd ed. New York: McGraw Hill, 2001.
5. F. Ergun, R. Sinha, and L. Zhang, "An improved FPTAS for restricted shortest path," Inf. Process. Lett., vol. 83, pp. 287-291, 2002.
6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: W.H. Freeman, 1979.
7. A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logothetis, "Efficient computation of delay-sensitive routes from one source to an destinations," in Proc. IEEE INFOCOM, 2001, pp. 854-858.
8. R. Guerin and A. Orda, "QoS routing in networks with inaccurate information: Theory and algorithms," IEEE/ACM Trans. Netw., vol. 7, no. 2, pp. 3150-364, Apr. 1999.
9. R. Hassin, "Approximation schemes for the restricted shortest path problem," Math. Oper. Res., vol. 17, pp. 36-42, 1992.
10. O. H. Ibarra and C. E. Kim, "Fast approximation algorithms for the knapsack and sum of subset problems," J. ACM, vol. 22, pp. 463-468, 1975.
11. J. M. Jaffe, "Algorithms for finding paths with multiple constraints," Networks, vol. 14, pp. 95-116, 1984.
12. A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, "Lagrange relaxation based method for the QoS routing problem," in IEEE INFOCOM, 2001, pp. 859-868.
13. T. Korkmaz and M. Krunz, "A randomized algorithm for finding a path subject to multiple QoS requirements," Comput. Netw., vol. 16, pp. 251-268, 2001.
14. W. Liu, W. Lou, and Y. Fang, "An efficient quality of service routing algorithm for delay-sensitive applications." Comput. Netw., vol. 47, pp. 87-104, 2005.
15. D. H. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest path problem," Oper. Res. Lett., vol. 28, pp. 213-219, 2001.
16. Q. Ma and P. Steenkiste, "Quality-of-service routing for traffic with performance guarantees," in Proc. IWQoS'97, May 1997.
17. Orda, "Routing with end-to-end QoS guarantees in broadband networks," IEEE/ACM Trans. Netw., vol. 7, no. 3, pp. 365-374, Jun. 1999.
18. A. Orda and A. Sprintson, "Precomputation schemes for QoS routing," IEEE/ACM Trans. Netw., vol. 11, no. 4, pp. 578-591, Aug. 2003.
19. A. Orda and A. Sprintson, "Efficient algorithms for computing disjoint QoS paths," in Proc. IEEE INFOCOM, 2004, pp. 727-738.
20. S. Sahni, "General techniques for combinatorial approximation," Oper. Res., vol. 25. no. 920-936, 1977.
21. P. Van Mieghem and F. A. Kuipers, "Concepts of exact QoS routing algorithms," IEEE/ACM Trans. Netw., vol. 12, no. 5, pp. 851-864, Oct. 2004.
22. P. Van Mieghem, H. D. Neve, and F. A. Kuipers, "Hon-by-hop quality of service routing," Comput. Netw., vol 37, pp. 407-423, 2001.
23. 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, Sep. 1996.
24. A. Warburton, "Approximation of Pareto optima in multiple-objective, shortest path problem," Oper. Res., vol. 35, pp. 70-79, 1987.
25. B. M. Waxman, "Routing of multipoint connections," IEEE J. Sel. Areas, Commun., vol. 6, no. 9, pp. 1617-1622, Dec. 1988.
26. D. B. West, Introduction to Graph Theory. Englewood Cliffs, NJ: Prentice-Hall, 1996.
27. Y. Xiao, K. Thulasiraman, and G. Xue, "QoS routing in communication networks: Approximation algorithms based on the primal simplex method of linear programming," IEEE Trans. Comput., vol. 55, no. 7, pp. 815-829. Jul. 2006.
28. G. Xue, "Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees," in Proc. IEEE IPCCC, 2000, pp. 271-277.
29. G. Xue, "Minimum cost QoS multicast and unicast routing in communication networks," IEEE Trans. Commun., vol. 51, no. 5, pp. 817-824, May 2003.
30. G. Xue, A. Sen, and R. Banka, "Routing with many additive QoS constraints," in Proc. IEEE ICC, 2003, pp. 223-227.
31. G. Xue, A. Sen, W. Zhang, J. Tang, and K. Thulasiraman, "Finding a path subject to many additive QoS constraints," IEEE/ACM Trans. Netw., vol. 15, no. 1, p. 201-211, Feb. 2007.
32. X. Yuan, "Heuristic algorithm for multiconstrained quality-of-service routing," IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 244-256, Apr. 2002.