Multiconstrained QoS routing: Greedy is good

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 1866-1871

  Xue, Guoliang ^a   Zhang, Weiyi ^a  

^a NONE

Author keywords

Efficient approximation algorithms; Greedy algorithms; Multiple additive constraints; QoS routing

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; INTERNET PROTOCOLS; PROBLEM SOLVING; QUALITY OF SERVICE;

EFFICIENT APPROXIMATION ALGORITHMS; GREEDY ALGORITHMS; MULTICONSTRAINED PATH PROBLEM (MCP); MULTIPLE ADDITIVE CONSTRAINTS;

NETWORK ROUTING;

EID: 39349095835     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.359     Document Type: Conference Paper

References (32)

1. R. Andersen, F. Chung, A. Sen, G. Xue; On disjoint path pairs with wavelength continuity constraint in WDM networks; IEEE Infocom'2004; pp. 524-535.
2. BRITE; http://www.cs.bu.edu/brite/.
3. S. Chen and K. Nahrstedt; On finding multi-constrained paths; IEEE ICC'1998; pp. 874-879.
4. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein; Introduction to Algorithms; second edition; McGraw Hill, 2001.
5. F Ergun, R. Sinha and L. Zhang; An improved FPTAS for restricted shortest path; Information Processing Letters; Vol. 83(2002), pp. 287-291.
6. M.R. Garey and D.S. Johnson; Computers and Intractability: A Guide to the Theory of NP-Completeness; 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 all destinations; IEEE Infocom'2001; pp. 854-858.
8. R. Guerin and A. Orda; QoS routing in networks with inaccurate information: theory and algorithms; IEEE/ACM Transactions on Networking; Vol. 7(1999), pp. 350-364.
9. R. Hassin; Approximation schemes for the restricted shortest path problem; Mathematics of Operations Research; Vol. 17(1992), pp. 36-42.
10. O.H. Ibarra and CE. Kim; Fast approximation algorithms for the knapsack and sum of subset problems; Journal of the ACM; Vol. 22(1975), pp. 463-468.
11. J.M. Jaffe; Algorithms for finding paths with multiple constraints; Networks; Vol. 14(1984), pp. 95-116.
12. A. Juttner, B. Szviatovszki, I. Mecs and Z. Rajko; Lagrange relaxation based method for the QoS routing problem; IEEE Infocom'2001; pp. 859-868.
13. T Korkmaz and M. Krunz; A randomized algorithm for finding a path subject to multiple QoS requirements; Computer Networks; Vol. 36(2001), pp. 251-268.
14. FA. Kuipers, A. Orda, D. Raz, and P. Van Mieghem; A comparison of exact and e-approximation algorithms for constrained routing, IFIP Networking '2006, Coimbra, Portugal, May 15-19, 2006.
15. W Liu, W Lou, and Y. Fang; An efficient quality of service routing algorithm for delay-sensitive applications; Computer Networks; Vol. 47(2005), pp. 87-104.
16. D.H. Lorenz and D. Raz; A simple efficient approximation scheme for the restricted shortest path problem; Operations Research Letters; Vol. 28(2001), pp. 213-219.
17. Q. Ma and P. Steenkiste; Quality-of-service routing for traffic with performance guarantees; IWQoS'97, May 1997.
18. A. Orda and A. Sprintson; Precomputation schemes for QoS routing; IEEE/ACM Transactions on Networking; Vol. 11(2003), pp. 578-591.
19. A. Orda and A. Sprintson; Efficient algorithms for computing disjoint QoS paths; IEEE Infocom'2004; pp. 727-738.
20. S. Sahni; General techniques for combinatorial approximation; Operations Research; Vol. 25(1977), pp. 920-936.
21. P. Van Mieghem and FA. Kuipers, Concepts of exact QoS routing algorithms; IEEE/ACM Transactions on Networking; Vol. 12(2004), pp. 851-864.
22. P. Van Mieghem, H.D. Neve and FA. Kuipers; Hop-by-hop quality of service routing; Computer Networks; Vol. 37(2001), pp. 407-423.
23. Z. Wang and J. Crowcroft; Quality-of-service routing for supporting multimedia applications; IEEE Journal on Selected Areas in Communications; Vol. 14(1996), pp. 1228-1234.
24. A. Warburton; Approximation of Pareto optima in multiple-objective, shortest path problem; Operations Research; Vol. 35(1987), pp. 70-79.
25. B.M. Waxman; Routing of multipoint connections; IEEE Journal on Selected Areas in Communications; Vol. 6(1988), pp. 1617-1622.
26. D.B. West; Introduction to Graph Theory; 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 Transactions on Computers; Vol. 55(2006), pp. 815-829.
28. G. Xue; Minimum cost QoS multicast and unicast routing in communication networks; IEEE Transactions on Communications; Vol. 51(2003), pp. 817-824.
29. G. Xue, A. Sen and R. Banka; Routing with many additive QoS constraints; ICC2003: IEEE International Conference on Communications; pp. 223-227.
30. G. Xue, A. Sen, W Zhang, J. Tang and K. Thulasiraman; Finding a path subject to many additive QoS constraints, IEEE/ACM Transactions on Networking; Vol. 15(2007), pp. 201-211.
31. G. Xue, W. Zhang, J. Tang and K. Thulasiraman; Polynomial time approximation algorithms for multi-constrained QoS routing; IEEE/ACM Transactions on Networking; accepted for publication.
32. X. Yuan; Heuristic algorithms for multiconstrained quality-of-service routing; IEEE/ACM Transactions on Networking; Vol. 10(2002), pp. 244-256.