A NFA-based programmable regular expression match engine

ANCS'09: Symposium on Architecture for Networking and Communications Systems

Volumn , Issue , 2009, Pages 60-61

  Pao, Derek ^a  

^a CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

finite automata; hardware accelerator; intrusion detection; regular expression

Indexed keywords

HARDWARE ACCELERATOR; HARDWARE FEATURES; INCREMENTAL CHANGES; LOOK UP TABLE; NONDETERMINISTIC FINITE AUTOMATON; PATTERN SET; PROGRAMMABLE HARDWARE; REGULAR EXPRESSIONS; SPEED-UPS; SUB-PATTERNS; SYSTEM THROUGHPUT; TABLE SIZE; TERNARY CONTENT ADDRESSABLE MEMORIES; TRANSITION-EDGE;

ARCHITECTURE; AUTOMATA THEORY; HARDWARE; INTRUSION DETECTION; LOGIC GATES; TABLE LOOKUP;

PIPELINE PROCESSING SYSTEMS;

EID: 78650933190     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1882486.1882499     Document Type: Conference Paper

References (6)

1. M. Becchi, P. Crowley, "Extending finite automata to efficiently match Perl-compatible regular expressions", ACM CoNEXT 2008.
2. B. C. Brodie, R. K. Cytron, D. E. Taylor, "A scalable architecture for high-throughput regular-expression pattern matching", Int. Symp. on Computer Architecture, 2006.
3. R. Smith, C. Estan, S. Jha, S. Kong, "Deflating the Big Bang: Fast and Scalable Deep Packet Inspection with Extended Finite Automata", ACM SIGCOMM 2008.
4. I. Sourdis, S. Vassiliadis, J. Bispo, J. M. P. Cardoso, "Regular Expression Matching in Reconfigurable Hardware", Journal of Signal Processing Systems, Vol. 51, pp. 99-121, 2008.
5. Y.-H. E. Yang, W. Jiang, V. K. Prasanna, "Compact architecture for high-throughput regular expression matching on FPGA", ACM/IEEE ANCS 2008, pp. 30-39.
6. Full manuscript. http://www.ee.cityu.edu.hk/~dpao.