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 routing domains and routing layers.In hierarchical routing

each routing domain compact 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—SHEF algorithm is proposed to compact the asymmetric directed graph.Based upon a heavy-edge-first rule

the source-oriented method and minimum spanning tree are integrated to aggregate the directed graph.Compared with the traditional method

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

as a result yields outstanding routing performance.