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

Authors:
Fernando Kuipers;Ariel Orda;Danny Raz;Piet Van Mieghem
Affiliations:
Delft University of Technology, Delft, The Netherlands;Israel Institute of Technology, Technion, Haifa, Israel;Israel Institute of Technology, Technion, Haifa, Israel;Delft University of Technology, Delft, The Netherlands
Venue:
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Year:
2006

Citing 7
Cited 2

Approximation schemes for the restricted shortest path problem

Mathematics of Operations Research
Routing with end-to-end QoS guarantees in broadband networks

IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
PATHS IN THE SIMPLE RANDOM GRAPH AND THE WAXMAN GRAPH

Probability in the Engineering and Informational Sciences
Concepts of exact QoS routing algorithms

IEEE/ACM Transactions on Networking (TON)
A simple efficient approximation scheme for the restricted shortest path problem

Operations Research Letters
Performance evaluation of constraint-based path selection algorithms

IEEE Network: The Magazine of Global Internetworking

Efficient QoS partition and routing of unicast and multicast

IEEE/ACM Transactions on Networking (TON)
An overview of algorithms for network survivability

ISRN Communications and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Constrained Routing Problem is a multi-criteria optimization problem that captures the most important aspects of Quality of Service routing, and appears in many other practical problems. The problem is NP-hard, which causes exact solutions to require an intractable running time in the worst case. ε -approximation algorithms provide a guaranteed approximate solution for all inputs while incurring a tractable (i.e., polynomial) computation time. This paper presents a performance evaluation of these two types of algorithms. The main performance criteria are accuracy and speed.