基于STP的以太网物理拓扑发现  

An Algorithm Based on STP For Ethernet Physical Topology Discovery

作　　者：李玉鹏[1] 王换招[1] 赵青苹[1] 

机构地区：[1]西安交通大学计算机科学与技术系,西安710049

出　　处：《北京电子科技学院学报》2004年第2期8-13,共6页Journal of Beijing Electronic Science And Technology Institute

基　　金：国家"863"计划资助项目(863-2001AA112111)

摘　　要：拓扑发现是网络管理和网络行为学研究的重要基础。本文提出了一种基于STP树逐级分析的以太网拓扑发现算法。和已有的方法相比,本算法不要求各个网桥FDB表的信息是完备的,同时处理过程的复杂度比较低,而且对于备份链路也能很好地发现。实验表明该算法是一种快速、准确、全面的拓扑发现算法。Topology discovery is important for network management and network behavior research. A novel algorithm for ethemet topology discovery based on STP and gradual analysis is proposed in this paper. A compared to previous algorithms, this algorithm does not require the information of each bridge FDB table to be complete. Besides, its computing complexity is reduced effectively and the redundant links of LAN can be discovered. Experiments show that it is a fast, accurate and complete algorithm for Ethernet physical topology discovery.

关 键 词：生成树协议 PING 以太网 拓扑发现 Bridge-MIB 

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