基于改进DoubleTree算法的网络拓扑发现方法

A Topology Discovery Method Based on the Improved DoubleTree Algorithm

Double Tree算法是一种重要的IP级网络拓扑发现方法,极大减少了探测冗余,但该方法会产生大量的网络通信量,增加了网络负担。本文在Double Tree算法的基础上,通过对全局停止集存放结构的改进,实现了Double Tree++算法。实验证明,该方法在达到95%的网络覆盖度的同时,减少了50%探测冗余,并且降低了探测源点间的网络通信量。

The DoubleTree algorithm is one of the important IP level topology discovery methods. It can reduce probe redundancy dramatically; however, it also brings about a great deal of network traffic, promoting the network burden. In this paper, a DoubleTree＋ ＋ algorithm based on DoubleTree, is designed and implemented via improving the storage structure of the global stop set. The experiment shows that DoubleTree＋ ＋ can reduce 50% probe redundancy and decrease the network traffic among probe sources, while covering 95 % network nodes and links.