Distributed QoS Routing
Shigang Chen, Klara Nahrstedt · 1997
The task of Quality-of-Service (QoS) routing is to find a path in the network that satisfies certain constraints on metrics such as bandwidth, delay, delay jitter and cost. Most previous work on routing does not support guaranteed quality of service, which makes this area relatively new. All recently-published QoS routing algorithms consider one or two specific metrics and most of them require the maintenance of a global network state at each node. We propose a family of distributed routing algorithms which require every node to maintain only its local state. The algorithms use a distributed computation to collectively utilize the most up-to-date local information at each node to find a path. The found path is guaranteed to be loop-free. All the algorithms are uniformized into the same framework. A generic algorithm is proposed as the common basis for developing concrete routing algorithms on specific metrics. Key words --- Quality-of-service routing, distributed algorithms, generic al...