摘要
分析网络层节点路由器、三层交换机等设备的路由表,从指定的路由器开始,按照无向图的广度优先遍历过程逐步发现网络层元素间的连接关系,处理了一台路由器对应多个IP地址的问题,并分析了算法的复杂度为Ο(n2).测试结果表明,算法能发现路由器-路由器、路由器-子网连接关系,适合实际的网络层拓扑发现.
The whole discovery process began with a specified router, then queried and analyzed the ipRontingTable of this router to discover its neighborhood and the link relationship through breadth first travel strategy. We also handled the problem that one router owns multiple ip addresses. The time consume of the algorithm is valued as O（n^2）. The test shows that this algorithm can discover router-router, router-subnet links and solve the problem one router with multiple ip addresses.
出处
《长沙理工大学学报（自然科学版）》
CAS
2009年第1期69-72,共4页
Journal of Changsha University of Science and Technology:Natural Science
基金
湖南省自然科学基金资助项目(07JJ3120)
湖南省科技厅科研资助项目(2006GK3068)
湖南省教育厅科研资助项目(07C081)
关键词
网络管理
简单网管协议
网络层
拓扑发现
network management
simple network management protocol
network layer
topology discovery
