基于完全无冲突哈希的IP数据包分类算法研究  

Study on the Absolute Nol-collision Hash IP Classification Algorithms

作　　者：尚凤军[1] 王海霞[1] 

机构地区：[1]重庆邮电学院

出　　处：《计算机工程与应用》2004年第34期173-175,共3页Computer Engineering and Applications

基　　金：重庆市自然科学基金项目;重庆邮电学院青年教师基金资助

摘　　要：介绍了IP分类技术研究的最新成果,以及IP分类的典型算法。提出了一种基于完全无冲突哈希和跳转表Trie树(NHJTTT:Nol-collisionHashandJumpingTableTrie-Tree)的IP分类算法,通过分析比较,该文提出的算法无论是时间性能还是空间性能均优于GridofTries算法,文章通过仿真给出了最终的分类效果。最后该文对提出的算法在虚拟环境下作了评判。This article surveys the recent advances in the research of IP classification and introduces some of the typical algorithms.We describe a combination scheme that combines the advantages of both schemes.At last,a novel IP classification is proposed based on the non-collision hash and jumping table Trie-tree(NHJTTT)algorithm.Through analysing and comparing the performance,the new algorithm proposed in this paper is prior to Grid of Tries in both time and space.It has better overall performance than many other algorithms.

关 键 词：IP分类 查找算法 TRIE树 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]