摘要
该文提出了一种新的物理网络拓扑发现算法。该算法的基本思想是采用树的形式表示交换机拓扑连接关系。在此理论基础上利用生成树集合演绎树的变化过程来完成拓扑发现,并结合一种典型的交换机连接关系进行了算法推导。理论分析和实际应用结果表明,这种新的拓扑发现算法在发现效率、准确性、有效性等方面都有了很大程度的提高。
This paper presents a new physical network topology discovery algorithm. The tree form is applied to describe the connections between switches. Based on this theory, the topology discovery is completed by using spanning tree set to deduce tree change, and the algorithm referring to a typical connection relationship between switches is derived. Theoretical analysis and practical application indicate that the proposed topology discovery algorithm is advanced in efficiency, accuracy and effectiveness.
出处
《电子与信息学报》
EI
CSCD
北大核心
2010年第1期172-177,共6页
Journal of Electronics & Information Technology
基金
国家自然科学基金(60572092)
国家"十一五"科技支撑计划项目(2006BAH02A0407)资助课题
关键词
网络测量
拓扑发现
地址转发表
生成树
Network measurement
Topology discovery
Address forwarding table
Spanning tree