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

Quality of Service Routing in the Internet. Theory, Complexity and Algorithms

The Internet consists of many network elements that direct packets on the correct path leading towards the destination. This process of finding and following a path to the destination is called routing. Routing is not infallible and packets may get lost: the current Internet cannot give any quality guarantees regarding the packets it transports....