Two techniques for fast computation of constrained shortest paths

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2004, Pages 1348-1352

  Chen, Shigang ^a   Song, Meongchul ^a   Sahni, Sartaj ^a  

^a UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; HEURISTIC METHODS; MULTIMEDIA SYSTEMS; POLYNOMIALS; QUALITY OF SERVICE; ROUTERS; TELECOMMUNICATION TRAFFIC;

ADMISSION CONTROL; HEURISTIC ALGORITHMS; ROUTING; TRAFFIC ENGINEERING;

TELECOMMUNICATION NETWORKS;

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

References (13)

1. 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, December 1998.
2. R. Guerin and A. Orda, "QoS-based Routing in Networks with Inaccurate Information: Theory and Algorithms," IEEE INFOCOM'97, Japan, April 1997.
3. H. R Salama, D. S. Reeves, and Y. Viniotis, "A Distributed Algorithm for Delay-Constrained Unicast Routing," IEEE INFOCOM'1997, pp. 84-91, April 1997.
4. A. Juttner, B. Szviatovszki, I. Mecs, and Z. Rajko, "Lagrange Relaxation Based Method for the QoS Routing Problem," IEEE INFOCOM'2001, April 2001.
5. T. Korkmaz and M. Krunz, "Multi-Constrained Optimal Path Selection," IEEE INFOCOM'2001, April 2001.
6. R. Hassin, "Approximation Schemes for the Restricted Shortest Path Problem," Mathematics of Operations Research, vol. 17, pp. 36-42, 1992.
7. S. Chen and K. Nahrstedt, "On Finding Multi-Constrained Paths," IEEE International Conference on Communications (ICC'98), June 1998.
8. A. Goel, K. G. Ramakrishnan, D. Kataria, and D. Logothetis, "Efficient Computation of Delay-Sensitive Routes for One Source to All Destinations," IEEE INFOCOM'2001, April 2001.
9. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W.H. Freeman and Co., 1979.
10. H. C. Joksch, "The Shortest Route Problem with Constraints," Journal of Mathematical Analysis and Applications, vol. 14, pp. 191-197, 1966.
11. D. Lorenz and D. Raz, "A Simple Efficient Approximation Scheme for the Restricted Shortest Paths Problem," Bell Labs Technical Memorandun, 1999.
12. S. Sahni, "General Techniques for Combinatorial Approximation," Operations Research, vol. 26, no. 5, 1977.
13. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On Power-Law Relationships of the Internet Topology," ACM Proceedings of SIGCOMM '99, 1999.