The advent of multimedia applications has triggered widespread interest in quality-of-service (QoS) support. An Internet-based QoS framework, Differentiated Services (DiffServ), has been proposed. The framework focuses mainly on packet scheduling. As such, it decouples routing from QoS provisioning. This typically results in inefficient routes, thereby limiting the ability of the network to support QoS requirements and to manage resources efficiently. This article proposes a scalable, clustering, and selective probing framework to assist in identifying and selecting routing paths that are very likely to meet the QoS requirements of the underlying application. The proposed approach can be seamlessly integrated into the DiffServ framework to extend its ability to support QoS requirements. A description of the basic components of the framework is provided. Scalability is achieved using a clustering algorithm, referred to as d-median, to reduce signaling and routers overhead. A thorough study to evaluate the performance of d-median is conducted. The results of the study show that, for power-law graphs such as the Internet, the d-median clustering-based approach outperforms existing clustering methods.
The scalability of routing in large scale networks, such as the Interne, is critical to achieve low delay and high throughput. The lack of scalability of routing protocols in large-scale networks results from the prohibitive overhead incurred during dissemination of path metric values across the network. This paper addresses this problem and proposes a cluster-based scheme, referred to as d-median, which strikes a balance between scalability and routing efficiency. In this scheme, the link metric information is exchanged on a per-cluster basis, rather than on a per-node basis thereby reducing considerably the routing overhead. The simulation results show that the scheme exhibits better performance compared to existing models.
The advent of the multimedia applications has triggered widespread interest in QoS supports. Two Internet-based QoS frameworks have been proposed: Integrated Services (IntServ) and Differentiated Services (DiffServ). IntServ supports service guarantees on a per-flow basis. The framework, however, is not scalable due to the fact that routers have to maintain a large amount of state information for each supported flow. DiffServ was proposed as an alternate solution to address the lack of scalability of the IntServ framework. DiffServ uses class-based service differentiation to achieve aggregate support for QoS requirements. This approach eliminates the need to maintain per-flow states on a hop-by-hop basis and reduces considerably the overhead routers incur in forwarding traffic.Both IntServ and DiffServ frameworks focus on packet scheduling. As such, they decouple routing from QoS provisioning. This typically results in inefficient routes, thereby limiting the ability of the network to support QoS requirements and to manage resources efficiently. The goal of this thesis is to address this shortcoming. We propose a scalable QoS routing framework to identify and select paths that are very likely to meet the QoS requirements of the underlying applications. The tenet of our approach is based on seamlessly integrating routing into the DiffServ framework to extend its ability to support QoS requirements. Scalability is achieved using selective probing and clustering to reduce signaling and routers overhead.The major contributions of this thesis are as follows: First, we propose a scalable routing architecture that supports QoS requirements. The architecture seamlessly integrates the QoS traffic requirements of the underlying applications into a DiffServ framework. Second, we propose a new delay-based clustering method, referred to as d-median. The proposed clustering method groups Internet nodes into clusters, whereby nodes in the same cluster exhibit equivalent delay characteristics. Each cluster is represented by anchor node. Anchors use selective probing to estimate QoS parameters and select appropriate paths for traffic forwarding.A thorough study to evaluate the performance of the proposed d-median clustering algorithm is conducted. The results of the study show that, for power-law graphs such as the Internet, the d-median clustering based approach outperforms the set covering method commonly proposed in the literature. The study shows that the widely used clustering methods, such as set covering or k-median, are inadequate to capture the balance between cluster sizes and the number of clusters. The results of the study also show that the proposed clustering method, applied to power-law graphs, is robust to changes in size and delay distribution of the network. Finally, the results suggest that the delay bound input parameter of the d-median scheme should be no less than 1 and no more than 4 times of the average delay per one hop of the network. This is mostly due to the weak hierarchy of the Internet resulting fr...
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.