Design of high performance pattern matching engine through compact deterministic finite automata

Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern matching, we identify its limitations and present two schemes, Label Translation Table (LTT) and CAM-based Lookup Table (CLT), to reduce the DFA memory size by 85%, and sim-plify the design by requiring only four processing elements of bit-DFA instead of thousands. Categories and Subject Descriptors C.3 [Special-purpose and Application-based Systems]: microprocessor/microcomputer applications; C.4 [Perform