Quality of Service Routing in the Internet
Theory, Complexity & Algorithms

By Fernando A. Kuipers
November 2004
Delft University Press
ISBN: 9040725233
243 pages, Illustrated, 6 ½" x 9 ½"
$77.50 Paper Original

---

This is a Ph.D. dissertation. An enormous amount of packets daily traverse the Internet towards their intended destination. The internet consists of many network elements that direct these packets on the correct path leading towards the destination. This process of finding and following a path to the destination is called routing.

Of course, routing is not infallible and packets may get lost: the current internet cannot give any guarantees regarding the packets it transports, i.e. there are no guarantees on the delay that packets experience, on the jitter, or the packet loss, nor can it guarantee the bandwidth available along the traveled path. However, many new mulit-medi applications cannot properly operate without such guarantees, e.g. for a voice conversation, the maximum delay must be bounded. Finding paths that can meet such demands is called Quality of Service routing.

Contents include: Introduction, Graphs, algorithms and complexity, Shortest path algorithms, Concepts of exact MCP algorithms, Overview of QoS algorithms, Multicast QoS routing, Link-disjoint QoS routing, The complexity of exact MCP algorithms, QoS dynamics, Conclusions.

Information Technology

Return to Coronet Books main page