紧凑路由算法一直被认为是未来Internet上可扩展路由算法的有力候选者,因为它实现了近似最短路径路由机制的同时,路由表也比BGP(border gateway protocol)路由协议更加紧凑.TZ紧凑路由算法初始地标点的选取是随机生成的,没有充分利用网络拓扑信息,不是很适合真实网络.故分别提出了基于节点度和基于PageRank算法的地标节点选取机制,用于改进TZ紧凑路由算法.在2000年和2006年的Internet AS图上对两种改进算法和TZ算法进行仿真,实验结果表明,两种改进算法的平均路由表大小和平均伸长系数相比于TZ算法均有明显的改进.%Compact routing has been proposed as a promising candidate for scalable routing on the future Internet because it achieves the near-shortest path routing with considerably less forwarding state than BGP. In TZ compact routing, initial landmark nodes are randomly selected, which does not make the best use of network topology and thus does not perform well in the real network. Hence, degree-based and PageRank-based methods were proposed for selecting the initial landmark nodes to improve the capability of TZ compact routing respectively. Then, the improved methods and TZ compact routing were applied on the Internet AS graph datasets of 2000 and 2006. The simulation results show that the improved methods can efficiently reduce the average size of routing tables and the average stretch respectively compared to those of TZ compact routing.
展开▼
