基于硬件的定长移位高速浮动关键词匹配算法

High speed unfixed keywords matching algorithm based on fixed-length shift and hardware

针对浮动关键词匹配问题,提出了一种基于TCAM的定长移位匹配算法。该算法通过对移动步长的灵活控制有效降低了存储器的访问频率,提高了系统速率。通过分析空间复杂度,该算法与其它移位加速算法相比,在一定的范围之内对TCAM容量的需求也具有明显的优势。算法性能分析和仿真表明,该算法不仅可以实现任意长度模式的线速搜索,还可以使系统所能支持的模式集规模达到几万条。

To deal with the problem of unfixed keyword matching,an unfixed keywords matching algorithm based on fixed-length shift and TCAM is proposed.The frequency of memory access from controlling the lenth of the keyword shifting is reduced.Compared to other algorithm,it has obvious advantage in memory consumption.The result of simulation shows that the algorithms match the keywords of any length in line speed and hold ten thousand keywords.