基于RFC优化算法的报文数据快速模式匹配  

Fast packet pattern-match based on optimized RFC algorithm

作　　者：王瑞钦 谭皇 Wang Ruiqin;Tan Huang(College of Economics and Management,Beijing Jiaotong University,Beijing 100044,China;Hefei Tynon Technology Corporation,Ltd.,Hefei 230000,China)

机构地区：[1]北京交通大学经济管理学院,北京100044 [2]合肥泰能路通科技有限公司,合肥230000

出　　处：《现代计算机》2024年第20期57-62,共6页Modern Computer

摘　　要：为提高报文数据模式匹配速度,对RFC算法进行优化。该优化算法通过选择优良的哈希算法对规则CBM比特位图进行去重匹配,从而降低预处理过程的时间复杂度;在“缩减”的最后阶段,将等价类规则CBM比特位图改为索引数组,使得数据平面的报文数据匹配查找时间复杂度由Ф(n^(2))降低到Ф(1),进一步减少了对空间资源的消耗。实验结果表明,该RFC优化算法有效降低了时间和空间复杂度,达到100 Gbps的处理性能水平,可以应用到各种流量攻击防护场景。An optimized RFC algorithm is proposed to improve the speed of fast packet pattern match.This algorithm reduces the time complexity of preprocessing by using an excellent hash algorithm to deduplicate the CBM.In the final reduction stage,this algorithm also replaces the CBM with an index array,which reduces the complexity of packet matching time in the data plane from∅(n^(2))to∅(1),and the consumption of memory space resource.The practical results show that the optimized RFC algorithm effec-tively reduces the time and memory space complexity and reaches the processing performance of 100 Gbps,which can be applied to various network traffic attack protection scenarios.

关 键 词：RFC算法 CBM位图 哈希去重 索引数组 模式匹配 

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