A Parallel Automaton string matching with Pre-Hashing and Root-Indexing techniques for content filtering coprocessor

Kuo Kun Tseng*, Ying-Dar Lin, Tsern-Huei Lee, Yuan Cheng Lai

*此作品的通信作者

研究成果: Conference article同行評審

9 引文 斯高帕斯(Scopus)

摘要

We propose a new Parallel Automaton string matching approach and its hardware architecture for content filtering coprocessor. This new approach can improve the average matching time of the Parallel Automaton with Pre-Hashing and Root-Indexing techniques. The Pre-Hashing technique uses a hashing function to verify quickly the text against the partial patterns in the Automaton, and the Root-Indexing technique matches multiple bytes for the root state in one single matching. A popular Automaton algorithm, Aho-Corasick (AC) is chosen to be implemented by adding the two techniques; we employ these two techniques in a memory efficient version of AC namely Bitmap AC. For the average-case time, our approach improves Bitmap AC by 494% and 224% speedup for URL and Virus patterns, respectively. Since Pre-Hashing and Root-Indexing techniques can be concurrently executed with Bitmap AC in the hardware, our proposed approach has the same worst-case time as Bitmap AC.

原文English
文章編號1540374
頁(從 - 到)113-118
頁數6
期刊Proceedings of the International Conference on Application-Specific Systems, Architectures and Processors
DOIs
出版狀態Published - 23 7月 2005
事件IEEE 16th International Conference on Application-Specific Systems, Architectures, and Processors, ASAP 2005 - Samos, Greece
持續時間: 23 7月 200525 7月 2005

指紋

深入研究「A Parallel Automaton string matching with Pre-Hashing and Root-Indexing techniques for content filtering coprocessor」主題。共同形成了獨特的指紋。

引用此