网络层与链路层综合拓扑发现算法及其实现  

Topology discovery algorithm and its realization for network layer and data link layer

作　　者：孙克辉[1] 陈艳山[1] 程巍[1] 张志强 

机构地区：[1]中南大学物理科学与技术学院,长沙410083 [2]深圳市中联通电子有限公司,广东深圳518067

出　　处：《计算机工程与应用》2012年第4期107-110,共4页Computer Engineering and Applications

基　　金：中南大学研究生创新基金项目资助(No.2009ssxt138)

摘　　要：为了实现对网络的有效管理与监控,采用层次化模型,提出了一种基于广度优先遍历的探索式拓扑发现算法。该算法将底层的设备发现与顶层的拓扑关系分析分离开来,在顶层利用图的相关理论,实现了网络层拓扑与物理网络拓扑的完整发现。与现有方法相比,该算法解决了网络层拓扑与数据链路层拓扑发现相互独立的问题,增强了其实用性。算法在中联通综合网络管理平台中的成功应用表明了其有效性。In order to achieve effective management and monitoring for computer networks, a topology discovery algorithm based on BFS （Breadth-First Search） is proposed. In the algorithm, the process of a topology discovery is divided into several layers. In the bot- tom layer, all of the devices in subnets can be found, and in the higher layers, it can get the topology between these devices using some graph theories easily. Compared with current discovery algorithms, this method can get the topology both in network layer and data link layer. It has been successfully applied to the ZLT＇ s network management platform, and the tests show that it has good stability and portability.

关 键 词：网络管理 拓扑发现 广度优先遍历 简单网络管理协议(SNMP) 互联网控制消息协议(ICMP) 

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