High speed pattern matching based on HASH-TCAM algorithm
基于HASH-TCAM算法的高速模式匹配研究*

Aiming at the poor throughput when long-pattern matching, this paper combined the hash scheme and TCAM scheme in the hardware implementations of the pattern matching, and proposed HASH-TCAM algorithm. This algorithm compressed the pattern string by hash process and increased the throughput. Theoretic analysis and experimental results demonstrate that the throughput of this proposed algorithm can reach 51.2 Gbps in case of the fixed keyword query length being 36 Byte and the number of pattern sets is 5000, at a cost of conflict rate, and this algorithm can meet the requirements under 40 Gbps wire-speed pattern matching.