作　　者： ; ; ;

机构地区： 中国科学院软件研究所

出　　处： 《计算机科学》 2003年第12期6-8,15,共4页

摘　　要： 1.引言 早期关于拓扑发现的研究主要集中于第3层,也就是网络层的拓扑结构,但是随着网桥被广泛用于连接多个局域网段构成桥接局域网(BLAN,Bridge Local Area Network)[1]以便提高网络的可靠性、获得更大的带宽或是提供不同局域网协议之间的互通[7],忽略第2层设备(网桥)之间连接关系的拓扑结构信息显得"粒度"太粗了,桥接局域网的网络管理需求使得网络拓扑结构的自动发现必须向下延伸. With the rapid development and the wide use of Bridged Local Area Networks, the importance of below-OSI-Layer-3 topology comes to be realized. Recent research work has demonstrated that active layer-2 topology can be determined using Address Forwarding Information. The large quantities of address forwarding entries in a typical BLAN, however, make their algorithms both time-consuming and bandwidth-consuming. In view of the above and the fact that transparent bridges are used preponderantly in real networks, we base our algorithm on information supported by Spanning Tree Protocol MIB group, which reduces the cost of acquiring and processing information, and improves the accuracy. Our algorithm relies on standard MIB information and can be used in heterogeneous environments.

关 键 词： 局域网 第 层拓扑结构 自动发现 桥接局域网 网桥 计算机网络

领　　域： [自动化与计算机技术] [自动化与计算机技术]