基于距离的IPv6校园网拓扑发现整合算法

Distance-Based Integration Algorithm for Topology Discovery of IPv6 Campus Network

针对IPv6网络拓扑发现方法存在的不足,提出一种基于距离的IPv6校园网拓扑发现整合算法.该算法利用开放式最短路径优先(OSPF)路由协议里的子网信息,以节点之间的最短距离作为度量,将基于Traceroute6的和基于OSPF路由协议的两种拓扑发现方法的结果进行整合,并根据子网前缀、接口等信息进行修正.在实际网络中对该算法进行了测试,并与基于跳数的整合算法进行了比较.结果表明:该算法能迅速有效地整合拓扑发现的结果,提高拓扑信息的完整性和准确性.

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 OS- PF （ Open Shortest Path First） routing protocol, the results of the Traceroute6-based and OSPF-based topology dis- covery methods are integrated with the shortest distance between nodes as the metrics. Then, they are adjusted ac- cording to subnet prefixes, interfaces, etc. Finally, the proposed algorithm is tested in the real network environ- ment 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.