Details

Autor(en) / Beteiligte

• Junchen Jiang
• Yang Xu
• Tian Pan
• Yi Tang
• Bin Liu

Titel

Pattern-Based DFA for Memory-Efficient and Scalable Multiple Regular Expression Matching

Ist Teil von

• 2010 IEEE International Conference on Communications, 2010, p.1-5

Ort / Verlag

IEEE

Erscheinungsjahr

2010

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE Xplore (IEEE/IET Electronic Library - IEL)

Beschreibungen/Notizen

• In Network Intrusion Detection System, De-terministic Finite Automaton (DFA) is widely used to compare packet content at a constant speed against a set of patterns specified in regular expressions (regex patterns). However, combining many regex patterns into a single DFA causes a serious state explosion. Partitioning the pat-tern set into several subsets, each of which produces a small DFA, is a practical way to deflate the state explosion. In this paper, we propose a regex pattern grouping scheme based on a new DFA model called Pattern-Based DFA (P-DFA) which supports efficient pattern-based op-erations, such as insertion, deletion, and etc. By using these basic operations, one can easily measure the state explo-sion when combining a set of regex patterns into a single DFA. Based on the privilege, we develop regex grouping algorithms for mitigating the state explosion in parallel and sequential matching environments, respectively. The evaluation shows that under the same constraints, our ap-proach requires only half the number of groups compared with the most well-known algorithms.