Quality-of-Service Routing for Traffic with Performance Guarantees
Qingming Ma, Peter Steenkiste · 1997
Quality-of-Service (QoS) routing tries to select a path that satisfies a set of QoS constraints, while also achieving overall network resource efficiency. We present initial results on QoS path selection for traffic requiring bandwidth and delay guarantees. For traffic with bandwidth guarantees, we found that several routing algorithms that favor paths with fewer hops perform well. For traffic with delay guarantees, we show that for a broad class of WFQ-like scheduling algorithms, the problem of finding a path satisfying bandwidth, delay, delay-jitter, and/or buffer space constraints while at the same time deriving the bandwidth that has to be reserved to meet these constraints, is solvable by a modified version of the Bellman-Ford shortest-path algorithm in polynomial time.