摘要
首先介绍了目前以太网物理拓扑发现的主要算法及存在的问题,然后提出了一种基于多子网交汇点的拓扑发现算法。算法围绕交汇点和利用最小需求地址转发表信息来推理、约简和建立物理拓扑连接关系。结合一种典型的多子网拓扑进行了算法推导。理论与应用分析表明,该算法能够利用不完整的地址转发表构造出整个网络拓扑结构,在发现效率和准确性等方面都有了较大提高,适用于解决包含哑设备的大型、异构的多子网拓扑发现问题。
The main achievements were introduced in physical topology discovery for Ethernet and the defaults of those methods were pointed out,then a new algorithm was proposed based on the intersection of multi-subnet.The algorithm uses the Minimum Requirements of Address Forwarding Table（AFT） around the intersection of multi-subnet to reason and establish the connection between switchers.And combining a typical multi-subnet topology,the algorithm was derived.Theoretical analysis proves that our method correctly infers the network topology with the incomplete AFTs,and has low communication and computational overheads,in which other methods fail The algorithm is appropriate for discovering the physical topology of large,heterogeneous Ethernet that may include multiple subnets as well as uncooperative network elements,like hubs.
出处
《计算机科学》
CSCD
北大核心
2014年第5期173-177,195,共6页
Computer Science
基金
国家973重点基础研究发展计划(2011CB311801)
国家863高技术研究发展计划(2012AA012704)
河南省科技创新人才计划(114200510001)资助
关键词
物理拓扑
子网连接树
交汇点
最小需求地址转发表
Physical topology
Connecting tree of subnet
Intersection node
Minimum requirements of address forwarding table
