100 likes | 247 Views
Pattern-Based DFA for Memory-Efficient and Scalable Multiple Regular Expression Matching. Author: Junchen Jiang, Yang Xu, Tian Pan, Yi Tang, Bin Liu Publisher: IEEE ICC 2010 Presenter:Wen-Tse Liang Date:2012/4/18. Outline. INTRODUCTION
E N D
Pattern-Based DFA for Memory-Efficient and Scalable Multiple Regular Expression Matching Author:Junchen Jiang, Yang Xu, Tian Pan, Yi Tang, Bin Liu Publisher:IEEE ICC 2010 Presenter:Wen-Tse Liang Date:2012/4/18
Outline • INTRODUCTION • propose a regex pattern grouping scheme based on a new DFA model called Pattern-Based DFA (P-DFA) • Pattern-Based DFA (P-DFA) • Pattern-Based Structure (PBS) • GROUPING ALGORITHM USING PBS • EVALUATION
INTRODUCTION It is well-known that multiple regex patterns can be combined into a single DFA to achieve a constant scanning speed which is independent to the number of regex patterns A practical solution of resolving the state explosion is to divide the set of regex patterns into several groups, and generate an individual DFA for each group.
INTRODUCTION The most well-known regex pattern grouping algorithms [4] have to check the chance of state explosion between every two regex patterns, and only group patterns without interactivity together.
GROUPING ALGORITHM USING PBS • For general purpose processor architecture • minimizes the number of groups while keeping the total number of states limited. • For multi-parallel processor architecture • minimizes the number of groups while keeping the number of states in each group limited.