摘要
通过对数据链路层现状和存在的不足的研究,基于生成树的特点提出一种数据链路层拓扑发现算法。从生成树的根节点开始,依据交换机直接连接的规则,确定交换机-交换机连线;对于不能依据本规则确定连接的端口,则引入哑节点Hub,以发现交换机-Hub的连接关系。测试结果表明,该算法能够高效地发现网络拓扑结构,准确识别链路连接类型,是解决该问题的一种有效方法。
Analyses the development and defect of the data link layer,provides an algorithm based on spanning tree to discover link layer topology.The recursive process begins with the root switch and the switch-switch link are determined according to the link rule,and introduces a dummy node Hub in the case that no direct links can be determined for the current port.The test shows that this algorithm can discover physical layer topology effectively,correctly identify the link connection types,and is an effective means of solving this problem.
出处
《现代计算机》
2011年第6期9-12,共4页
Modern Computer
