Quality-of-Service Routing for Traffic with Performance Guarantees

Abstract

Quality-of-Service (QoS) routing tries to select a path thatsatisfies a set of QoS constraints, while also achieving overall networkresource efficiency. We present initial results on QoS path selectionfor traffic requiring bandwidth and delay guarantees. For traffic withbandwidth guarantees, we found that several routing algorithms thatfavor paths with fewer hops perform well. For traffic with delayguarantees, we show that for a broad class of WFQ-like schedulingalgorithms, the problem of finding a path satisfying bandwidth, delay,delay-jitter, and/or buffer space constraints while at the same timederiving the bandwidth that has to be reserved to meet theseconstraints, is solvable by a modified version of the Bellman-Fordshortest-path algorithm in polynomial time.