Approximation algorithms for multiconstrained quality-of-service routing

IEEE Transactions on Computers

Volumn 55, Issue 5, 2006, Pages 603-617

  Meongchul, Song ^a   Sahni, Sartaj ^b  

^a SAMSUNG Electronics   (South Korea)

^b University of Florida   (United States)

Author keywords

Approximation algorithm; Heuristic; Interval partitioning; Quality of service routing

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; ROUTERS;

APPROXIMATION ALGORITHM; INTERVAL PARTITIONING; MULTICONSTRAINED ROUTING; QUALITY OF SERVICE ROUTING; SOURCE-TO-DESTINATION PATH;

QUALITY OF SERVICE;

EID: 33645818562     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2006.67     Document Type: Article

References (19)

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, vol. 12, no. 6, pp. 64-79, Nov./Dec. 1998.
2. S. Chen and K. Nahrstedt, "On Finding Multi-Constrained Paths," Proc. IEEE Int'l Conf. Comm., June 1998.
3. S. Chen, M. Song, and S. Sahni, "Two Techniques for Fast Computation of Constrained Shortest Paths," Proc. IEEE GLOBECOM, Nov./Dec. 2004.
4. M. Faloutsos, P. Faloutsos, and C. Faloutsos, "On Power-Law Relationships of the Internet Topology," Proc. ACM SIGCOMM, Aug./Sept. 1999.
5. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco: Freeman, 1979.
6. A. Goel, K.G. Ramakrishnan, D. Kataria, and D. Logothetis, "Efficient Computation of Delay-Sensitive Routes from One Source to All Destinations," Proc. IEEE INFOCOM, Apr. 2001.
7. R. Hassin, "Approximation Schemes for the Restricted Shortest Path Problem," Math. Operational Research, vol. 17, no. 1, pp. 36-42, Feb. 1992.
8. E. Horowitz and S. Sahni, "Computing Partitions with Applications to the Knapsack Problem," J. ACM, vol. 21, no. 2, pp. 277-292, Apr. 1974.
9. J.M. Jaffe, "Algorithms for Finding Paths with Multiple Constraints," Networks, vol. 14, pp. 95-116, 1984.
10. T. Korkmaz and M. Krunz, "A Randomized Algorithm for Finding a Path Subject to Multiple QoS Requirements," Computer Networks, vol. 36, nos. 2-3, pp. 251-268, July 2001.
11. T. Korkmaz and M. Krunz, "Multi-Constrained Optimal Path Selection," Proc. IEEE INFOCOM, Apr. 2001.
12. T. Korkmaz, M. Krunz, and S. Tragoudas, "An Efficient Algorithm for Finding a Path Subject to Two Additive Constraints," Computer Comm. J., vol. 25, no. 3, pp. 225-238, Feb. 2002.
13. F. Kuipers, T. Korkmaz, and M. Krunz, "An Overview of Constraint-Based Path Selection Algorithms for QoS Routing," IEEE Comm. Magazine, vol. 40, no. 12, pp. 50-55, Dec. 2002.
14. D.H. Lorenz and D. Raz, "A Simple Efficient Approximation Scheme for the Restricted Shortest Path Problem," Operational Research Letters, vol. 28, no. 5, pp. 213-219, June 2001.
15. S. Sahni, "General Techniques for Combinatorial Approximation," Operational Research, vol. 25, no. 6, pp. 920-936, Nov./Dec. 1977.
16. S. Sahni, Data Structures, Algorithms, and Applications in C++, second ed. Summit, N.J.: Silicon Press, 2005.
17. R. Widyono, "The Design and Evaluation of Routing Algorithms for Real-Time Channels," TR-94-024, Int'l Computer Science Inst., Univ. of California Berkeley, 1994.
18. O. Younis and S. Fahmy, "Constraint-Based Routing in the Internet: Basic Principles and Recent Research," IEEE Comm. Surveys and Tutorials, vol. 5, no. 1, pp. 2-13, 2003.
19. X. Yuan, "Heuristic Algorithms for Multiconstrained Quality of Service Routing," IEEE/ACM Trans. Networking, vol. 10, no. 2, pp. 244-256, Apr. 2002.