A comparison of exact and e-approximation algorithms for constrained routing

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

Volumn 3976 LNCS, Issue , 2006, Pages 197-208

  Kuipers, Fernando ^a   Orda, Ariel ^b   Raz, Danny ^b   Van Mieghem, Piet ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Performance evaluation; QoS routing; RSP algorithms

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS; CONSTRAINED OPTIMIZATION; OPTIMIZATION; POLYNOMIAL APPROXIMATION; QUALITY OF SERVICE; TELECOMMUNICATION NETWORKS;

COMPUTATION TIME; PERFORMANCE EVALUATION; QOS ROUTING; RSP ALGORITHMS; APPROXIMATE SOLUTION; CONSTRAINED ROUTING; MULTICRITERIA OPTIMIZATION; PERFORMANCE CRITERION; PRACTICAL PROBLEMS; QUALITY OF SERVICE ROUTING;

ROUTERS; APPROXIMATION ALGORITHMS;

EID: 33745914625     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11753810_17     Document Type: Conference Paper

References (9)

1. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco, 1979.
2. A. Goel, K.G. Ramakrishnan, D. Kataria, D. Logothetis, "Efficient Computation of Delay-sensitive Routes from One Source to All Destinations, " Proc. of IEEE INFOCOM, pp. 854-858, 2001.
3. R. Hassin, "Approximation schemes for the restricted shortest path problem," Mathematics of Operations Research, vol. 17, no. 1, pp. 36-42, February 1992.
4. F.A. Kuipers and P. Van Mieghem, "The impact of correlated link weights on QoS routing," Proc. of the IEEE INFOCOM Conference, vol. 2, pp. 1425-1434, April 2003.
5. F.A. Kuipers, T. Korkmaz, M. Krunz and P. Van Mieghem, "Performance Evaluation of Constraint-Based Path Selection Algorithms," IEEE Network, vol. 18, no. 5, pp. 16-23, September/October 2004.
6. D.H. Lorenz and D. Raz, "A simple efficient approximation scheme for the restricted shortest path problem," Operations Research Letter, vol. 28, no. 5, pp. 213-219, June 2001.
7. A. Orda, "Routing with end-to-end QoS guarantees in broadband networks," IEEE/ACM Transactions on Networking, vol. 7, no. 3, pp. 365-374, 1999.
8. P. Van Mieghem, "Paths in the simple random graph and the waxman graph," Probability in the Engineering and Informational Sciences (PEIS), no. 15, pp. 535-555, 2001.
9. P. Van Mieghem and F.A. Kuipers, "Concepts of exact quality of service algorithms," IEEE/ACM Transactions on Networking, vol. 12, no. 5, pp. 851-864, October 2004.