Selective Flooding for Better QoS Routing

• Main Author: Kannan, Gangadharan
• Other Authors: Mark L. Claypool, Advisor
• Format: Others
• Published: Digital WPI 2000
• Subjects: High-speed Networks; Selective Flooding; QoS Routing; Computer network protocols; Internet; Real-time data processing
• Online Access: https://digitalcommons.wpi.edu/etd-theses/800; https://digitalcommons.wpi.edu/cgi/viewcontent.cgi?article=1799&context=etd-theses

Quality-of-service (QoS) requirements for the timely delivery of real-time multimedia raise new challenges for the networking world. A key component of QoS is QoS routing which allows the selection of network routes with sufficient resources for requested QoS parameters. Several techniques have been proposed in the literature to compute QoS routes, most of which require dynamic update of link-state information across the Internet. Given the growing size of the Internet, it is becoming increasingly difficult to gather up-to-date state information in a dynamic environment. We propose a new technique to compute QoS routes on the Internet in a fast and efficient manner without any need for dynamic updates. Our method, known as Selective Flooding, checks the state of the links on a set of pre-computed routes from the source to the destination in parallel and based on this information computes the best route and then reserves resources. We implemented Selective Flooding on a QoS routing simulator and evaluated the performance of Selective Flooding compared to source routing for a variety of network parameters. We find Selective Flooding consistently outperforms source routing in terms of call-blocking rate and outperforms source routing in terms of network overhead for some network conditions. The contributions of this thesis include the design of a new QoS routing algorithm, Selective Flooding, extensive evaluation of Selective Flooding under a variety of network conditions and a working simulation model for future research.