Efficient regular expression evaluation: Theory to practice

Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS '08

Volumn , Issue , 2008, Pages 50-59

  Becchi, Michela ^a   Crowley, Patrick ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DEEP PACKET INSPECTION; HARDWARE ARCHITECTURE; LINE RATE; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING;

APPLICATION SPECIFIC INTEGRATED CIRCUITS;

EID: 70350692284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1477942.1477950     Document Type: Conference Paper

References (24)

1. A. Aho and M. Corasick, "Efficient String Matching: An Aid to Bibliographic Search," Communication of ACM, 1975.
2. J. Hopcroft and J Ullman, "Introduction to Automata Theory, Languages, and Computation," Addison Wesley, 1979.
3. J. Hopcroft, "An nlogn algorithm for minimizing states in a finite automaton," in Theory of Machines and Computation, J. Kohavi, Ed. New York: Academic, 1971, pp. 189-196.
4. K. Thompson, "Regular expression search algorithm," in Communications of the ACM, vol. 11, Issue. 6, June 1968, pp. 419-422.
5. R. McNaughton and H. Yamada, "Regular Expressions and State Graphs for Automata," in IEEE Transactions on Electronic Computers, EC-9(1), pp. 39-47, 1960.
6. S. Kumar et al., "Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection," in ACM SIGCOMM, Sept 2006.
7. M. Becchi and P. Crowley, "An Improved Algorithm to Accelerate Regular Expression Evaluation," in ANCS 2007.
8. B. Brodie et al., "A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching," in ISCA 2006.
9. S. Kumar et al., "Advanced Algorithms for Fast and Scalable Deep Packet Inspection," in ANCS 2006.
10. F. Yu et al., "Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection," in ANCS 2006.
11. M. Becchi and P. Crowley, "A Hybrid Finite Automaton for Practical Deep Packet Inspection," in CoNEXT 2007.
12. S. Kumar et al., "Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia," in ANCS 2007.
13. R. Smith et al.,"XFA: Faster Signature Matching with Extended Automata," in 2008 IEEE Symposium on Security and Privacy.
14. R. Sidhu and V. K. Prasanna, "Fast Regular Expression Matching using FPGAs," in FCCM 2001.
15. C. R. Clark and D. E. Schimmel, "Efficient reconfigurable logic circuit for matching complex network intrusion detection patterns," in FPL 2003.
16. J. Moscola et al., "Implementation of a content-scanning module for an internet firewall," in FCCM 2003.
17. R. Franklin et al., "Assisting Network Intrusion Detection with Reconfigurable Hardware," in FCCM 2002.
18. C. R. Clark et al., "Efficient reconfigurable logic circuit for matching complex network intrusion detection patterns," in FLP 2003.
19. I. Sourdis et al., "Pre-decoded CAMs for Efficient and High-Speed NIDS Pattern Matching," in FCCM 2004.
20. A. Mitra et al., "Compiling PCRE to FPGA for Accelerating SNORT IDS," in ANCS 2007.
21. M. Roesch, "SNORT: Lightweight Intrusion Detection for Networks," in 13th System Administration Conf., Nov 1999.
22. SNORT: http://www.snort.org
23. R. Sommer and V. Paxson, "Enhancing byte-level network intrusion detection signatures with context," in CCS 2003.
24. Xilinx: http://www.xilinx.com