基于最短路径的多子网链路层拓扑发现算法  

Link layer topology discovery for multi-subnet networks based on shortest path

作　　者：孟颖翔[1] 高东怀[2] 许浩[2] 许卫中[2] 

机构地区：[1]西北大学现代教育技术中心,西安710069 [2]第四军医大学网络中心,西安710032

出　　处：《计算机工程与应用》2016年第2期131-134,164,共5页Computer Engineering and Applications

摘　　要：针对当前基于地址转发表实现链路层拓扑发现的典型算法在复杂多子网环境下应用存在的问题,提出利用下行链路完整地址转发表构建并优化同一子网交换设备间的最短路径,实现链路层拓扑自动发现的算法。经理论和实际环境验证,证明该算法可以较好地发现复杂多子网链路层拓扑结构,具有较强的实践意义和推广价值。The application of the typical link layer topology discovery algorithms based on address forwarding table is not ideal for multi-subnet networks. In view of the problem, this paper proposes a link layer topology discovery algorithm based on shortest path. Utilizing the complete downlink AFT, it constructs shortest paths which are between switch devices in the same subnet and then optimizes these paths to accomplish the algorithm. Verified by the theory and practice in actual network environment, the algorithm can discover the link layer topology for multi-subnet networks, it also has a strong practical significance and promotional value.

关 键 词：多子网 链路层拓扑 地址转发表 下行链路 最短路径 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]