Routing with many additive QoS constraints

IEEE International Conference on Communications

Volumn 1, Issue , 2003, Pages 223-227

  Xue, Guoliang ^a   Sen, Arunabha ^a   Banka, Rakesh ^a  

^a Arizona State University   (United States)

Author keywords

Efficient approximation algorithms; Multiple additive constraints; Quality of service routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CONSTRAINT THEORY; POLYNOMIALS; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION LINKS;

MULTIPLE ADDITIVE CONSTRAINTS;

TELECOMMUNICATION NETWORKS;

EID: 0038052965     PISSN: 05361486     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. S. Chen and K. Nahrstedt, On finding multi-constrained paths, IEEE ICC'98, pp. 874-879.
2. S. Chen and K. Nahrstedt, An overview of quality-of-service routing for the next generation high-speed networks: problems and solutions, IEEE Network, Vol. 12, No. 6(1998), pp. 64-79.
3. F. Ergun, R. Sinha and L. Zhang, QoS routing with performance-dependent costs, IEEE INFOCOM'00, pp. 137-146.
4. M.L. Fredman and R.E. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, Journal of the ACM, Vol. 34(1987), pp. 596-615.
5. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, 1979.
6. A. Goel, K.G. Ramakrishnan, D. Katarja and D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations, IEEE INFOCOM'01, pp. 854-858.
7. R. Hassin, Approximation schemes for the restricted shortest path problem, Mathematics of Operations Research, vol. 17(1992), pp. 36- 42.
8. J.M. Jaffe, Algorithms for finding paths with multiple constraints, Networks, Vol. 14(1984), pp. 95-116.
9. T. Korkmaz and M. Krunz, A randomized algorithm for finding a path subject top multiple QoS requirements, IEEE INFOCOM'01, pp. 834- 843.
10. T. Korkmaz and M. Krunz, Mult-constrained optimal path selection, Computer Networks, Vol. 36(2001), pp. 251-268.
11. 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.
12. J.A. Nelder and R. Mead, A simplex method for function minimization, The Computer Journal, Vol. 7(1965), pp. 308-313.
13. R. Ravindran, K. Thulasiraman, A. Das, K. Huang, G. Lou and G. Xue, Quality of service routing: heuristics and approximation schemes with a comparative evaluation, IEEE ISCAS'02, accepted for publication.
14. H.F. Salama, D.S. Reeves and Y. Viniotis, A distributed algorithm for delay-constrained unicast routing, IEEE INFOCOM'97, pp. 84-91.
15. Z. Wang and J. Crowcroft, Bandwidth-delay-based routing algorithms, IEEE GLOBECOM'95, pp. 2129-2133.
16. 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.
17. A. Warburton, Approximation of Pareto optima in multiple-objective, shortest path problem, Operations Research, Vol. 1(1987), pp. 70-79.
18. X. Xiao and L.M. Ni, Internet QoS: a big picture, IEEE Network, vol. 13, no. 2, 1999, pp. 8-18.
19. X. Yuan and X. Liu, Heuristic Algorithms for Multi-constrained QoS routing, IEEE INFOCOM'01, pp. 844-853.
20. G. Xue, Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees, IEEE IPCCC2000, pp. 271-277.