一种基于子树交汇点的多子网拓扑发现算法  

A TOPOLOGY DISCOVERY ALGORITHM IN MULTI-SUBNET BASED ON INTERSECTION OF MULTI-SUBTREE

作　　者：曾光[1,2] 陈性元[1] 杜学绘[1,2] 王超[1,2] 

机构地区：[1]解放军信息工程大学,河南郑州450001 [2]数学工程与先进计算国家重点实验室,河南郑州450001

出　　处：《计算机应用与软件》2015年第8期121-126,共6页Computer Applications and Software

基　　金：国家重点基础研究发展计划项目(2011CB311801);国家高技术研究发展计划项目(2012AA012704)

摘　　要：准确、及时的网络拓扑信息对网络管理、协议设计和网络安全等领域工作具有重要意义。针对包含哑设备的大型、异构多子网拓扑发现问题,提出一种基于子树交汇点的物理拓扑发现算法。算法通过围绕子树交汇点,利用改进的连接信息扩展规则进行连接判定与信息推理补完,自顶向下的进行拓扑发现。理论分析与实验结果表明,该算法能够利用不完整的地址转发表构建出整个网络拓扑结构,在发现效率和准确性等方面都有了较大提高。Accurate and up-to-date network topology information plays a crucial role in network management,protocol design and network security,etc. To discover the problems targeting at the large and heterogeneous multiple subnets that may include dumb network elements,we propose a new multi-subtree intersection-based physical topological discovery algorithm. Around the intersection of multi-subtree,the algorithm uses the improved connection information extension rules to carry out the connection discriminant and the reasoning and finishing up of information,as well as the top-down topology discovery. It is demonstrated by theoretical analysis and experimental results that this algorithm can construct an entire network topology with the incomplete AFTs,and improves a great deal in both discovery efficiency and accuracy.

关 键 词：物理拓扑 子网拓扑树 交汇点 可达节点集 扩展规则 

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