基于SNMP的MIB构结树高效算法研究  

Effective algorithm research of MIB structure tree based on SNMP

作　　者：罗毅[1] 姚桂玲[1] 

机构地区：[1]湖北第二师范学院,湖北武汉430205

出　　处：《计算机工程与设计》2010年第15期3386-3389,共4页Computer Engineering and Design

基　　金：国家自然科学基金项目(60672051)

摘　　要：简单网络管理协议是一套定义管理信息存储、传递的应用层协议标准,它使得各种网络设备可以被统一的管理,而SNMP软件的主要性能瓶颈在于保存和查找MIB(管理信息库)对象的效率。考虑到其资源利用率和执行效率的高低对被管系统的整体性能有着直接的影响,对基于SNMP的MIB库的访问进行了研究。分析了MIB树的构造原理,提出了两种算法,并对它们进行了比较,结果表明了该方法的可行性。Along with the rapid development of Internet,simple network management protocol（SNMP） is regarded as a set of application layer protocol system by which definitions are given to administrate information storage and delivery.Various network equipments are enabled to be uniformly managed.But the bottleneck problem of the main functions of SNMP software lies in the efficiency of storing and searching the MIB（management information base） objects.Considering the direct influence of its resource utilization and execution efficiency on the overall performance of the managed system,this thesis offers two algorithms and makes comparison with them after analyzing the constructive principle of MIB Structure Tree and proves the feasibility of this method,which is based on the research of the accesses to MIB（Management Information Base） of SNMP.

关 键 词：SNMP MIB 网络管理 算法 ASN.1 

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