Routing with QoS information aggregation in hierarchical networks

Abstract

In this paper, we consider the problem of routing with two additive constraints in the hierarchical networks, such as the Internet. In order for scalability, the supported QoS information in the hierarchical networks has to be aggregated. We propose a novel method for aggregating the QoS information. To the best of our knowledge, our approach is the first study to use the area-minimization optimization, the de facto optimization problem of the QoS information aggregation. We use a set of real numbers to approximate the supported QoS between different domains. The size of the set is predefined so that advertisement overhead and the space requirement will not grow exponentially as the network size grows. The simulation results show that the proposed method outperforms the existing methods.