Algorithms for the multi-constrained routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 338-347

  Puri, Anuj ^a   Tripakis, Stavros ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINED ROUTING; COST CONSTRAINTS; DELAY CONSTRAINTS; MULTIPLE CONSTRAINT;

ROUTING ALGORITHMS;

EID: 84943261691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_35     Document Type: Conference Paper

References (8)

1. S. Chen and K. Nahrstedt. On finding multi-constrained paths. In International Conference on Communications (ICC’98), June 1998.
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, Special Issue on Transmission and Distribution of Digital Video, 1998.
3. H. F. Salama et. al. A distributed algorithm for delay-constrained unicast routing. In IEEE INFOCOM’97, Kobe, Japan, April 1997.
4. M. Garey and D. Johnson. Computers and Intractability: a guide to the theory of NP-completeness. Freeman, 1979.
5. R. Hassin. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1), February 1992.
6. J. M. Jaffe. Algorithms for finding paths with multiple constraints. Networks, 14:95–116, 1984.
7. A. Orda. Routing with end-to-end qos guarantees in broadband networks. IEEE/ACM Transactions on Networking, June 1999.
8. Z. Wang and J. Crowcroft. Quality-of-service routing for supporting multimedia applications. IEEE Journal on Selected Areas in Communications, 14(7), September 1996.