快速园区网拓扑发现方法  

Fast Topology Discovery for Campus Network

作　　者：李晓歌[1] 王辉[1] 张宾 秦董洪[3] LI Xiao-ge WANG Hui ZHANG Bin QIN Dong-hong(Department of Automation and Control, Henan University of Animal Husbandry and Economy, Zhengzhou 450000, China Research Institute No. 63, Nanjin9 210007, China School of Information Science and Engineering, Guangxi University for Nationalities, Nanning 530006, China)

机构地区：[1]河南牧业经济学院自动化与控制系,郑州450000 [2]总参第63所,南京210007 [3]广西民族大学信息科学与工程学院,南宁530006

出　　处：《应用科学学报》2016年第6期768-777,共10页Journal of Applied Sciences

基　　金：国家自然科学基金(No.61462009);中国博士后基金(No.2015M582832);江苏省博士后科研基金(No.1402138C);河南省高等学校重点项目基金(No.13B520337);广西自然科学基金(No.2014GXNSFAA118358)资助

摘　　要：基于简单网管协议的拓扑发现通常需要扫描整个网段,尤其是对于小规模园区网,网段中会有许多IP地址无回应,大大增加了拓扑发现时间.为此,提出用层次遍历的方法由边缘设备向核心设备逐步搜索以便完成拓扑发现,不需要扫描网络中的IP地址,仅通过地址转发表就能高效快速地获取整个园区网的拓扑结构.仿真实验表明,该方法可在1 min内推断出包含80个节点的网络拓扑关系,通过实际部署进一步验证了方法的有效性.To obtain the topology of a network, scan of the entire network is neces- sary, which is time consuming in practice. The time needed in finding topology is long especially for small-scale campus network where a large number of IP addresses do not respond to the ＂ping＂ message. To solve the problem, this paper proposes a fast topology discovery method without scanning the network, but only based on the address forward- ing table. Using a hierarchical traversal strategy, the proposed algorithm discovers the topology by searching devices starting from the outer rim to the center. Simulation results show that the proposed method can deduce the connection of a network including up to 80 nodes in one minute. Performance and effectiveness of the method are verified in practical applications.

关 键 词：拓扑发现 地址转发表 简单网管协议 地址解析协议 路由器 

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