Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (16): 121-123.DOI: 10.3778/j.issn.1002-8331.2010.16.035

• 网络、通信、安全 • Previous Articles     Next Articles

Network link layer topology discovery algorithm based on spanning tree

DENG Ze-lin,FU Ming,LIU Yi-nan   

  1. Department of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410076,China
  • Received:2009-02-03 Revised:2009-04-01 Online:2010-06-01 Published:2010-06-01
  • Contact: DENG Ze-lin

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

邓泽林,傅 明,刘翌南   

  1. 长沙理工大学 计算机与通信工程学院,长沙 410076
  • 通讯作者: 邓泽林

Abstract: An algorithm based on spanning tree is provided to discover link layer topology.The recursive process begins with the root switch and the switch-switch links are determined according to the link rule proposed in this paper,and a dummy node Hub is introduced in the case that no direct links can be determined for the current port.The test shows that this algorithm can discover network effectively.

Key words: network topology, heterogeneous network, Simple Network Management Protocol(SNMP), switched domain, incomplete Address Forwarding Table

摘要: 为了进行链路层拓扑发现,依据生成树的特点提出了一种自顶向下的算法。从生成树的根节点开始递归,依据交换机直接连接的规则,确定交换机-交换机连线;对于不能依据本规则确定连接的端口,则引入哑节点Hub,以发现交换机-Hub的连接关系。测试结果表明,该算法能够高效地发现网络拓扑结构。

关键词: 网络拓扑, 异构网络, 简单网管协议, 交换域, 不完全地址转发表

CLC Number: