摘要
递归数据流匹配算法(RFC)是一种高性能包匹配算法。但随着规则库中规则维数的增长以及规模的增加,必将使系统内存消耗殆尽。对RFC进行改进以减少内存消耗,把规则库分成几个子集,每个规则存储在一个独立的子集中。采用多种方法对RFC数据结构进行精简,进一步改善算法的速度和内存性能。实验结果表明,该改进算法大大降低了RFC总体内存消耗,极大提高了包匹配的计算性能。
RFC is a high performance packet matching algorithm.However,with the increase of rule dimension and scalein rule base,the system memory will be exhausted.In this paper,RFC is improved to reduce memory consumption.By dividing the rule base into several subsets,each rule was stored in a separate subset.A variety of methods were used to simplify the RFC data structure to further improve the speed and memory performance of the algorithm.The experimental results show that the improved RFC algorithm greatly reduces the overall memory consumption of RFC and greatly improves the performance of packet matching.
作者
蔡艳婧
孔苏鹏
程实
王则林
Cai Yanjing;Kong Supeng;Cheng shi;Wang Zelin(College of Electronics and Information,Jiangsu Vocational College of Business,Nantong 226001,Jiangsu,China;School of Information Science and Technology,Nantong University,Nantong 226019,Jiangsu,China)
出处
《计算机应用与软件》
北大核心
2021年第5期256-262,共7页
Computer Applications and Software
基金
国家自然科学基金项目(61771265)
江苏省高职院校教师专业带头人高端研修项目(2018GRFX022)
2019年江苏高校“青蓝工程”优秀青年骨干教师培养项目(苏教师〔2019〕3号文件)
江苏省高职院校青年教师企业实践培训项目(2019QYSJPX077)
南通市科技计划(指导性)项目(MSZ18080)。
