摘要
随着大规模交换网络的发展,网络拓扑发现的研究由网络层拓展到数据链路层.链路层的拓扑发现能够发现网络层拓扑发现无法发现的局域网内部的详细的物理连接情况.通过对数据链路层现状和存在的不足的研究,提出了一种基于STP树的数据链路层拓扑发现算法,该算法不要求各个网桥FDB表的信息是完备的,就能快速准确地计算出网络第二层的拓扑结构.
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. The development and defect of the data link layer are analyzed. In order to improve the imperfect, a novel algorithm for data link hayer topology discovery based on STP is proposed. This algorithm does not require the information of each bridge FDB table to be complete. Using it, an accurate topology graph of layer - 2 can be constructed rapidly.
出处
《微电子学与计算机》
CSCD
北大核心
2008年第5期132-134,共3页
Microelectronics & Computer
基金
国家"八六三"计划项目(2002AA142030)
