一种内存优化的RFC包分类算法Merge_RFC  

Memory-optimized RFC Packet Classification Algorithm Merge_RFC

作　　者：曹婕[1] 陈兵[1] 

机构地区：[1]南京航空航天大学信息科学与技术学院,南京210016

出　　处：《小型微型计算机系统》2012年第4期865-868,共4页Journal of Chinese Computer Systems

基　　金：国防预研基金项目(9140C60040307HT08)资助

摘　　要：递归流包分类(RFC)算法是目前分类速度较快的一种基于软件实现的多维包分类算法.但是该算法随着规则集规模的增大,占用大量的内存空间,存储开销巨大.针对这一问题,提出一种内存优化的RFC算法Merge_RFC.该算法提出一种位串合并的方法,对RFC算法的交叉乘积表进行压缩,消除冗余空间.仿真结果表明,Merge_RFC在保持较高分类速度的前提下,可以将RFC算法占用的内存空间压缩80%以上.Among software-based multi-dimensional packet classification algorithms, RFC （ Recursive Flow Classification ） has a good performance in classification speed. But the excessive memory consumption incurred by the expansion of filter sets costs large storage. Therefore, Merge_RFC, a memory optimized RFC, is proposed in this paper, designing a method of merging bit strings to com- press the cross-producing tables and reduce the memory redundancy of RFC. The simulation results show the outstanding performance of Merge_RFC that it can reduce the memory consumption up to 80% when achieving the same classification speed as RFC.

关 键 词：包分类 RFC算法 内存优化 交叉乘积表 

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