基于非对称有向网络的拓扑抽象算法研究.pdfVIP

1 Vol. 34 No. 1 2006 1 ACTA ELECTRONICA SIN ICA Jan. 2006 刘爱波, 陆月明, 纪越峰 (, 100876) : , . , , . SH EF, , . , 7 % , , . : ; ; ; : TN91 02 : A : ( 2006) 0101800 R esearch on Topology A ggregation in A symm etric D irected N etw orks LIU A ibo, LU Yuem ing, JIYuefeng (S ch ool of Telecommun ica tion Engineering, B eij ing Un ivers ity of P osts and Te lecommun ica tions, Be ji ing 100876, Ch ina ) Ab stract: Routing scalability may degrade due to the increasing network scale. So the global communication network in the futurew ill intend to a hierarchical routing architecturew ithmultiple routing domains and routing lay ers. In hierarchical routing, each routing dom ain compact its internal topology by topology aggregation algorithm and propagates the aggregated routing information to outside. So the topology aggregation algorithm w ill affect the routing perform ance greatly. In this paper, a novel topology aggregation method SHEF algorithm is proposed to compact the asymm etric directed graph. Based upon a heavyedgefirst rule, the sourceoriented m ethod and m inmi um spanning tree are integrated to aggregate the directed graph. Compared w ith the traditionalm ethod, the suggested algorithm can reduce theweight dev iation by 7 percent. Smi ulation results show that SHEF has a good tradeoff between the routing information complexity and routing accuracy, as a result yields outstanding routing performance. K ey words: topology aggregation; directed graph; m inmi um spanning tree; asymmetry network 1