检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:叶小涛[1] 魏海平[1] 王福威[1] 吕爱丽[1]
机构地区:[1]辽宁石油化工大学信息工程学院,辽宁抚顺113001
出 处:《石油化工高等学校学报》2005年第3期82-86,共5页Journal of Petrochemical Universities
摘 要:介绍了SNMP(简单网络管理协议)及MIB-Ⅱ规范,详细地描述了基于SNMP的网络拓扑发现技术的实现原理。针对现有基于SNMP的网络拓扑自动发现算法复杂度较高的缺点,提出了更为有效的网络拓扑实现算法,合理利用二叉排序树和判断相邻路由器IP等方法来减少重复访问路由器次数,从而使算法复杂度从可访问路由器的3次幂降为2次幂,并指出这是基于SNMP的网络拓扑发现最低可能阶次。提高了网络管理的效率和质量,对开发和改进网络管理系统有较大的实用价值。SNMP and MIB-II framework were introduced and the realization theory of network topology discovery based on SNMP was depicted in detail. According to the high complexity of the present network topology autodiscovery algorithm based on SNMP, a more effective algorithm was proposed, which made properly 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 and the square is the minimum magnitude possible for algorithms of SNMP-based network topology discovery. This algorithm improves the efficiency and quality of network management and has applicable value to development and improvement of network management system.
分 类 号:TP393.1[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222