Pipelined Architecture for Multi-String Matching

We present a pipelined approach to hardware implementation of the Aho-Corasick (AC) algorithm for string matching called P-AC. By incorporating pipelined processing, the state graph is reduced to a character trie that only contains forward edges. Edge reduction in P-AC is very impressive and is guaranteed algorithmically. For a signature set with 4434 strings extracted from the Snort rule set, the memory cost

• Type: Journal
• Year: 2008
• Where: CAL
• Authors: Derek Chi-Wai Pao, Wei Lin, Bin Liu
• Keywords: CAL 2008, Character Trie, Pipelined Approach, Software Engineering, String Matching