A novel topology aggregation algorithm for hierarchical routing in asymmetric networks

Routing scalability may degrade due to the increasing network scale. So the global communication network in the future will intend to a hierarchical routing architecture with multiple subnetworks and routing layers. In hierarchical routing architecture, each subnetwork compacts its internal topology by topology aggregation algorithm and propagates the aggregated routing information to outside. So the topology aggregation algorithm will affect the routing performance greatly. In this paper, a novel topology aggregation method-SUEF algorithm is proposed to compact the asymmetric directed graph. Based upon the heavy-edge-first principle, the source-oriented method is integrated with minimum spanning tree method to aggregate the directed graph. Compared with the traditional methods, the suggested algorithm can reduce the weight deviation by 75 percent. Simulation results show that SHEF has a good tradeoff between the routing information complexity and routing accuracy, so yields outstanding routing performance.