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∅(n2)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位图/哈希去重/索引数组/模式匹配
Key words
RFC/CBM/Hash deduplication/index array/pattern match
万方数据