摘要
为了进行链路层拓扑发现,依据生成树的特点提出了一种自顶向下的算法。从生成树的根节点开始递归,依据交换机直接连接的规则,确定交换机-交换机连线;对于不能依据本规则确定连接的端口,则引入哑节点Hub,以发现交换机-Hub的连接关系。测试结果表明,该算法能够高效地发现网络拓扑结构。
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.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第16期121-123,共3页
Computer Engineering and Applications
基金
湖南省自然科学基金(No.07JJ3120)
湖南省科技计划项目(No.2006GK3068)
湖南省教育厅资助项目(No.07C081)~~
关键词
网络拓扑
异构网络
简单网管协议
交换域
不完全地址转发表
network topology
heterogeneous network
Simple Network Management Protoco(lSNMP)
switched domain
incomplete Address Forwarding Table