一种改进的DoubleTree网络拓扑探测方法  

An Improved Network Topology Detection Method based on DoubleTree Algorithm

作　　者：吕见霞[1] 高仲合[1] 吴静静[1] 

机构地区：[1]曲阜师范大学计算机科学学院,山东日照276826

出　　处：《通信技术》2012年第9期54-56,60,共4页Communications Technology

摘　　要：网络拓扑测量是对网络进行管理的基础,为加强网络管理,提高网络利用率,防止大规模的网络攻击提供了技术平台,并已经成为人们普遍关心的重要问题之一。测量采用何种方法是网络拓扑测量的关键,通过分析网络拓扑探测方法DoublTree算法的关键技术,针对DoubleTree算法的初始跳数难以选择和数据共享时的通信量较高的问题,对DoublTree算法进行了改进,提出一种新的网络拓扑探测方法H-DoubleTree算法,该算法有效地降低了探测冗余和探测源节点间的通信量。实验结果也较好地证明了这一点。Measurement of network topology, as the foundation of network management, provides a technology platform for enhancing the network management, raising the network utilization, and preventing the large-scale network attack, thus becomes an important issue of public concern, and so which method to be used in the measurement is the key to the measurement of network topology. Based on that the H-DoubleTree algorithm could effectively reduce the probe redundancy and decrease the network traffic among probe sources, an improved algorithm called H-DoubleTree algorithm is proposed. This algorithm could solve the two problems in DoubleTree algorithm its the initial hop count is hard to select and the communication traffic is fairly high in data sharing. Simulation on this proposed algorithm proves these results.

关 键 词：拓扑测量 DoubleTree算法 探测冗余 网络通信量 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]