多模式匹配算法及硬件实现  

Multi-Pattern Matching Algorithms and Hardware Based Implementation

作　　者：李伟男[1,2] 鄂跃鹏[1,2] 葛敬国[1] 钱华林[1] 

机构地区：[1]中国科学院计算机网络信息中心 [2]中国科学院研究生院,北京100049

出　　处：《软件学报》2006年第12期2403-2415,共13页Journal of Software

基　　金：国家自然科学基金No.90412011;中国科学院院长基金No.KGCX2-YW-106~~

摘　　要：介绍了多模式匹配的算法和硬件实现方法.首先介绍了两种常用的多模式匹配算法——Aho-Corasick基于自动机的算法和Wu-Manber基于hash的后缀匹配加移位跳跃的算法以及相关的改进算法.并通过实验对各种多模式匹配算法的时空复杂度进行了分析比较.通过几个硬件实现的实例介绍了多模式匹配的硬件实现方法及策略.最后对多模式匹配的发展趋势进行了展望.This paper surveys the algorithms and hardware implementations of the multi-pattern matching. Firstly, two commonly used multi-pattern algorithms, Aho-Corasick＇s automata based algorithm and Wu-Manber＇s hash based suffix matching with skipping algorithm are introduced. And then, some improving ways are referred. Next, time and space complexity of these algorithms are analyzed, and the experimental results show their performances. Further, several hardware based implementations are taken as examples to demonstrate the general methods and strategies for the implementation on hardware. The developing trend is predicted in the end.

关 键 词：多模式匹配 AHO-CORASICK算法 有限状态自动机 WU-MANBER算法 FPGA(现场可编程门阵列) TCAM(三态内容寻址存储器) bloom filter 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]