SNMP协议动态MIB结构与高效查找算法  

Dynamic MIB Structure of SNMP and High Performance Search Algorithm

作　　者：周剑[1] 张晓彤[1] 王沁[1] 

机构地区：[1]北京科技大学计算机科学与技术系,北京100083

出　　处：《计算机工程》2008年第2期171-174,共4页Computer Engineering

基　　金：北京市科技基金资助重大项目"交互式数字电视信道传输核心技术开发"(京科技发[2002]188号)

摘　　要：SNMP是一种简单网络管理协议,作为HFC网络管理的重要组成部分,其资源利用率和执行效率的高低对被管系统的整体性能有重要影响。而SNMP软件的主要性能瓶颈在于保存和查找MIB对象的效率。该文通过分析MIB的结构特点,对比目前普遍使用的Hash表法,提出了使用多路径树来保存完整MIB结构的方法,消除公共ID的重复存储,提高资源利用率。在此基础上,给出一种综合使用多路径树和AVL树的高效查找算法,它能够有效地提高MIB对象的查找效率。该方法已经成功地应用于自主开发的"双向有线HDTV信道传输系统"中,实际网络验证表明,该方法具有较高的查找性能和可靠性。SNMP protocol is a simple network management protocol. As an important part of most network management softwares, its resource wastage and efficiency have important influence on the performance of the whole system. According to study, the main bottleneck of SNMP software is MIB objects＇ storage and search. This paper proposes to use multi-path tree to keep the entire structure of MIB to eliminate the repeated storage of mutual indentifiers by analysing the structure of MIB tree. Compared with widely used Hash table, multi-path tree promotes the efficiency of resource usage. On the basis of that, this paper also proposes a high speed algorithm to search MIB objects by the combination of multi-path tree and AVL tree. The method above has been successfully applied to the bidirectional HDTV signal transmitting system and it is proved to be efficient and reliable in actual network environment.

关 键 词：HFC网络管理 SNMP协议 AVL树 

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