Aggregation-Based QoS Routing in the Internet

In this paper, we study the problem of QoS routing with two concave constraints in the Internet. We propose an efficient approach for computing the supported QoS across domains based on the aggregated intradomain topology. The time complexity of our approach is polynomial. Moreover, our approach can be incorporated in the distance-vector based routing protocol, such as BGP, the de facto inter-domain routing protocol in the Internet. Our simulation results show that our interdomain QoS routing protocol can successfully serve more than 80% of the total connection requests and is very scalable.