作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (18): 109-110,. doi: 10.3969/j.issn.1000-3428.2006.18.039

• 网络与通信 • 上一篇    下一篇

基于生成树的链路层拓扑发现算法

李延冰,马 跃,王 炜,万小强   

  1. (北京邮电大学计算机学院,北京 100876)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-09-20 发布日期:2006-09-20

A Link Layer Topology Discovery Algorithm Based on STP

LI Yanbing, MA Yue, WANG Wei, WAN Xiaoqiang   

  1. (College of Computer Science & Technology, Beijing University of Posts and Telecommunications, Beijing 100876)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-09-20 Published:2006-09-20

摘要: 随着大规模交换网络的发展,网络拓扑发现的研究由网络层拓展到数据链路层。链路层的拓扑发现能够发现网络层拓扑发现无法发现的局域网内部的详细的物理连接情况。该文提出了一种基于生成树算法的链路层网络拓扑发现算法,利用SNMP获得网桥MIB中的生成树信息,通过分析这些信息计算出链路层的网络拓扑,该算法相比其它算法更简单、高效,有应用价值。

关键词: 生成树协议, 拓扑发现, 网桥管理信息数据库, 简单网络管理协议

Abstract: With the development of large scale switching network, the study is transferred from network layer to data link layer. The link layer topology discovery can discover the physical topology internal a LAN, which the network layer topology discovery can not discover. A link layer topology discovery algorithm based on spanning tree algorithm is proposed. The algorithm gets the STP information from the bridge MIBs with the tool of SNMP. It can calculate the link layer topology on the basis of the information. The algorithm is simple and with high performance in application.

Key words: STP, Topology discovery, Bridge MIB, SNMP