节点文献
基于距离的IPv6校园网拓扑发现整合算法
Distance-Based Integration Algorithm for Topology Discovery of IPv6 Campus Network
【摘要】 针对IPv6网络拓扑发现方法存在的不足,提出一种基于距离的IPv6校园网拓扑发现整合算法.该算法利用开放式最短路径优先(OSPF)路由协议里的子网信息,以节点之间的最短距离作为度量,将基于Traceroute6的和基于OSPF路由协议的两种拓扑发现方法的结果进行整合,并根据子网前缀、接口等信息进行修正.在实际网络中对该算法进行了测试,并与基于跳数的整合算法进行了比较.结果表明:该算法能迅速有效地整合拓扑发现的结果,提高拓扑信息的完整性和准确性.
【Abstract】 Aiming at the shortcomings of the existing methods for IPv6 network topology discovery,a distance-based integration algorithm is proposed for IPv6 campus network.In the algorithm,by using the subnet information of OSPF(Open Shortest Path First) routing protocol,the results of the Traceroute6-based and OSPF-based topology discovery methods are integrated with the shortest distance between nodes as the metrics.Then,they are adjusted according to subnet prefixes,interfaces,etc.Finally,the proposed algorithm is tested in the real network environment and compared with the hop counts-based integration algorithm.The results show that the proposed algorithm can not only integrate the topology results rapidly and effectively but also improve the integrity and accuracy of the topology information.
【Key words】 IPv6; campus network; topology discovery; integration algorithm; Traceroute6; open shortest path first;
- 【文献出处】 华南理工大学学报(自然科学版) ,Journal of South China University of Technology(Natural Science Edition) , 编辑部邮箱 ,2012年08期
- 【分类号】TP393.18
- 【被引频次】8
- 【下载频次】157