【摘要】 介绍了SNMP(简单网络管理协议)及MIB-Ⅱ规范,详细地描述了基于SNMP的网络拓扑发现技术的实现原理。针对现有基于SNMP的网络拓扑自动发现算法复杂度较高的缺点,提出了更为有效的网络拓扑实现算法,合理利用二叉排序树和判断相邻路由器IP等方法来减少重复访问路由器次数,从而使算法复杂度从可访问路由器的3次幂降为2次幂,并指出这是基于SNMP的网络拓扑发现最低可能阶次。提高了网络管理的效率和质量,对开发和改进网络管理系统有较大的实用价值。更多还原

【Abstract】 SNMP and MIB -Ⅱ framework were introduced and the realization theory of network topologydiscovery based on SNMP was depicted in detail. According to the high complexity of the present networktopology autodiscovery algorithm based on SNMP, a more effective algorithm was proposed, which madeproperly use of binary sort tree and judging of neighboring router’s IP to reduce the times of repeated visiting.Thus the computation complexity is decreased from the cubic of the number of available routers to its square andthe square is the minimum magnitude possible for algorithms of SNMP- based network topology discovery. Thisalgorithm improves the efficiency and quality of network management and has applicable value to developmentand improvement of network management system.更多还原