Piti Piyachon
ABSTRACT
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 simplify the design by requiring only four processing elements of bit-DFA instead of thousands.
- A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM, 18(6):333--340, 1975. Google Scholar
Digital Library
- N. S. Artan and H. J. Chao. Multi-packet Signature Detection using Prefix Bloom Filters. In IEEE GLOBECOM, November 2005.Google ScholarCross Ref
- M. Becchi and S. Cadambi. Memory-Efficient Regular Expression Search Using State Merging. In IEEE INFOCOM, 2007.Google ScholarDigital Library
- H-J Jung, Z. K. Baker, and V. K. Prasanna. Performance of FPGA Implementation of Bit-split Architecture for Intrusion Detection Systems. In RAW at IEEE IPDPS, April 2006. Google ScholarDigital Library
- J. Ni, C. Lin, Z. Chen, and P. Ungsunan1. A Fast Multi-pattern Matching Algorithm for Deep Packet Inspection on a Network Processor. In International Conference on Parallel Processing, 2007. Google ScholarDigital Library
- P. Piyachon and Y. Luo. Efficient memory utilization on network processors for deep packet inspection. In ACM/IEEE Symposium on Architectures for Networking and Communications Systems, December 2006. Google ScholarDigital Library
- Piti Piyachon and Yan Luo. Compact State Machine for High Performance Pattern Matching. In ACM/IEEE Design Automation Conference, June 2007. Google ScholarDigital Library
- Snort. http://www.snort.org/, 2003.Google Scholar
- I. Sourdis, J. Bispo, J. M. P. Cardoso, and S. Vassiliadis. Regular Expression Matching in Reconfigurable Hardware. In Journal on VLSI and Signal Processing, October 2007. Google ScholarDigital Library
- L. Tan and T. Sherwood. A High Throughput String Matching Architecture for Intrusion Detection and Prevention. In IEEE/ACM International Symposium on Computer Architecture, 2005. Google ScholarDigital Library
- L. Tan and T. Sherwood. Bit-Split String-Matching Engines for Intrusion Detection and Prevention. In ACM Transactions on Architecture and Code Optimization (TACO), March 2006. Google ScholarDigital Library
Index Terms
- Design of high performance pattern matching engine through compact deterministic finite automata
Recommendations
Deterministic finite automata characterization and optimization for scalable pattern matching
Memory-based Deterministic Finite Automata (DFA) are ideal for pattern matching in network intrusion detection systems due to their deterministic performance and ease of update of new patterns, however severe DFA memory requirements make it impractical ...
Minimal cover-automata for finite languages
A cover-automaton A of a finite language L Σ is a finite deterministic automaton (DFA) that accepts all words in L and possibly other words that are longer than any word in L. A minimal deterministic finite cover automaton (DFCA) of a finite language L ...
Minimizing Deterministic Lattice Automata
Traditional automata accept or reject their input and are therefore Boolean. In contrast, weighted automata map each word to a value from a semiring over a large domain. The special case of lattice automata, in which the semiring is a finite lattice, ...
Comments