Delay-bandwidth constrained topology aggregation algorithm

In order to deal with hierarchical routing with delay and bandwidth constraints, a new topology aggregation algorithm called stair method was proposed. A regular virtual stair was used to represent the QoS property of all paths between any two border nodes. Then a full mesh with each link denoted by six tuples was constructed. According to the different characters of the parameters of six-meshes, the maximum weight spanning tree and star structures were adopted to compress them respectively. Simulation results show stair algorithm achieves not only better performance in terms of the loss ratio of state information of the network, but also the same space complexity of O(|B|) with the existing algorithms.