基于跳转表Trie树的IP分类算法  

A Jumping Table Trie-tree IP Classification Algorithm

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

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

出　　处：《计算机工程》2004年第24期75-76,85,共3页Computer Engineering

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

摘　　要：介绍了IP分类技术研究的最新成果及IP分类的典型算法。提出了一种基于跳转表Trie树JTTT的IP分类算法,通过分析比较,该算法无论是时间性能还是空间性能均优于位图交叉算法。同时,FPGA技术的飞速发展和数据处理速度的提高,使得可以用FPGA和SRAM进行处理,文中通过仿真给出了最终的分类效果。最后对提出的算法在虚拟环境下作了评判。This article surveys the recent advances in the research of IP classification and introduces some of the typical algorithms. It describes a combination scheme that combines the advantages of the both schemes. The combination scheme can be optimized to decrease rule numbers, at the same times, it is helpful to handle bitmap-intersection by means of FPGA. At last, a novel IP classification is proposed based on the jumping table Trie-tree algorithm. The new algorithm shows better performance in regard to both time and space. It has better overall performance than many other algorithms.

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

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