Abstract
Quality-of-Service (QoS) routing is extensively received for emerging distributed multimedia applications, which have stringent QoS requirements in terms of bandwidth, delay, delay jitter, cost or loss rate, etc. Essentially, QoS routing explores qualified routes between senders and receivers for establishing connections with some QoS guarantees. Previous studies on QoS routing can be classified into two categories: link-state based and probing based. Link-state approaches suffer from complexity of route computation, overhead of link-state dissemination, and imprecision of state information, while probing based approaches may incur tremendous message overhead and inefficient resource utilization.This thesis proposes a probing based, two-pass bandwidth-constrained routing algorithm based on bounded flooding. It achieves high performance and efficiency by employing three enhancements. First, the node-level distance test is used to reduce memory requirement and computational power on intermediate nodes. Second, dynamic route selection efficiently chooses better route for reservation and distributes traffic loads through the entire network. Third, a backup path is maintained on the destination node to deal with “reservation failure”, the basic problem of two-pass reservation schemes.Through simulation evaluations, the proposed algorithm outperforms similar two-pass algorithms in terms of average call acceptance rate with comparable average call setup time and message overhead. Further issues are also addressed in the end of this article.