Hardware-accelerated regular expression matching with overlap handling on IBM PowerEN™ processor

Proceedings - IEEE 27th International Parallel and Distributed Processing Symposium, IPDPS 2013

Volumn , Issue , 2013, Pages 1254-1265

  Atasu, Kubilay ^a   Doerfler, Florian ^b   Van Lunteren, Jan ^a   Hagleitner, Christoph ^a  

^a IBM RESEARCH ZURICH   (Switzerland)

^b Supercomputing Systems AG   (Switzerland)

Author keywords

automata theory; compilers; hardware accelerators; integer programming; regular expression matching

Indexed keywords

HARDWARE ACCELERATORS; HARDWARE-ACCELERATED; NETWORK INTRUSION DETECTION SYSTEMS; POST-PROCESSING TECHNIQUES; PROGRAMMABLE HARDWARE; REGISTER ALLOCATION; REGULAR EXPRESSIONS; REGULAR-EXPRESSION MATCHING;

AUTOMATA THEORY; COMPLEX NETWORKS; COMPUTER HARDWARE DESCRIPTION LANGUAGES; DISTRIBUTED PARAMETER NETWORKS; HARDWARE; INTEGER PROGRAMMING; PARALLEL PROCESSING SYSTEMS; PROGRAM COMPILERS;

PATTERN MATCHING;

EID: 84884899661     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2013.54     Document Type: Conference Paper

References (32)

1. Sarang Dharmapurikar, Praveen Krishnamurthy, Todd S. Sproull, and John W. Lockwood. Deep packet inspection using parallel bloom filters. IEEE Micro, 24(1):52-61, 2004.
2. Young H. Cho and William H. Mangione-Smith. A pattern matching coprocessor for network security. In Proc. DAC, pages 234-239. ACM, 2005.
3. Lin Tan and Timothy Sherwood. A high throughput string matching architecture for intrusion detection and prevention. In Proc. ISCA '05, pages 112-122, 2005.
4. Piti Piyachon and Yan Luo. Design of high performance pattern matching engine through compact deterministic finite automata. In Proc. DAC, pages 852-857. ACM, 2008.
5. SNORT network intrusion detection system. http://www.snort.org/.
6. Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghavan, Frederick Reiss, Shivakumar Vaithyanathan, and Huaiyu Zhu. SystemT: a system for declarative information extraction. SIGMOD Record, 37(4):7-13, 2008.
7. Yi-Hua E. Yang and Viktor K. Prasanna. Optimizing regular expression matching with SR-NFA on multi-core systems. In Proc. PACT, pages 424-433, 2011.
8. John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2000.
9. Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, and Jonathan Turner. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In Proc. SIGCOMM, pages 339-350, 2006.
10. Jan van Lunteren. High-performance pattern-matching for intrusion detection. In Proc. INFOCOM 2006, pages 1-13, 2006.
11. Fang Yu, Zhifeng Chen, Yanlei Diao, T. V. Lakshman, and Randy H. Katz. Fast and memory-efficient regular expression matching for deep packet inspection. In Proc. ANCS, pages 93-102. ACM, 2006.
12. Jonathan Rohrer, Kubilay Atasu, Jan van Lunteren, and Christoph Hagleitner. Memory-efficient distribution of regular expressions for fast deep packet inspection. In Proc. CODES+ISSS, pages 147-154, 2009.
13. Zachary K. Baker, Viktor K. Prasanna, and Hong-Jip Jung. Regular expression software deceleration for intrusion detection systems. In FPL, pages 1-8, 2006.
14. Sailesh Kumar, Balakrishnan Chandrasekaran, Jonathan Turner, and George Varghese. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In Proc. ANCS, pages 155-164, 2007.
15. Randy Smith, Cristian Estan, Somesh Jha, and Shijin Kong. Deflating the big bang: fast and scalable deep packet inspection with extended finite automata. In Proc. SIGCOMM '08, pages 207-218. ACM, 2008.
16. Jan van Lunteren and Alexis Guanella. Hardware-accelerated regular expression matching at multiple tens of Gb/s. In Proc. INFOCOM, pages 1737-1745, 2012.
17. A. Krishna, T. Heil, N. Lindberg, F. Toussi, and S. Vander-Wiel. Hardware acceleration in the IBM PowerEN processor: Architecture and performance. In Proc. PACT, 2012.
18. J. van Lunteren, C. Hagleitner, T. Heil, G. Biran, U. Shvadron, and K. Atasu. Designing a programmable wire-speed regular-expression matching accelerator. In Proc. MICRO, pages 461-472, 2012.
19. Mitra Purandare, Kubilay Atasu, and Christoph Hagleitner. Proving correctness of regular expression accelerators. In Proc. DAC, 2012.
20. Application layer packet classifier for Linux. http://l7-filter. sourceforge.net/.
21. Emerging threats rules. http://www.emergingthreats.net/.
22. Michela Becchi and Srihari Cadambi. Memory-efficient regular expression search using state merging. In Proc. INFOCOM, pages 1064-1072, 2007.
23. Benjamin C. Brodie, David E. Taylor, and Ron K. Cytron. A scalable architecture for high-throughput regular-expression pattern matching. SIGARCH Comput. Archit. News, 34(2):191-202, 2006.
24. Masanori Bando, N. Sertac Artan, Rihua Wei, Xiangyi Guo, and H. Jonathan Chao. Range hash for regular expression pre-filtering. In Proc. ANCS, pages 20:1-20:12, 2010.
25. Michela Becchi and Patrick Crowley. An improved algorithm to accelerate regular expression evaluation. In Proc. ANCS, pages 145-154, 2007.
26. Ioannis Sourdis, Joao Bispo, Joao M. Cardoso, and Stamatis Vassiliadis. Regular expression matching in reconfigurable hardware. J. Signal Process. Syst., 51(1):99-121, 2008.
27. Yi-Hua E. Yang, Weirong Jiang, and Viktor K. Prasanna. Compact architecture for high-throughput regular expression matching on FPGA. In Proc. ANCS, pages 30-39, 2008.
28. Michela Becchi and Patrick Crowley. A hybrid finite automaton for practical deep packet inspection. In Proc. CoNEXT, 2007.
29. Yi-Hua E. Yang and Viktor K. Prasanna. Space-time tradeoff in regular expression matching with semi-deterministic finite automata. In Proc. INFOCOM, pages 1853-1861, 2011.
30. Hiroki Nakahara, Tsutomu Sasao, and Munehiro Matsuura. A regular expression matching circuit based on a decomposed automaton. In Proc. ARC, pages 16-28, 2011.
31. Masanori Bando, N. Sertac Artan, and H. Jonathan Chao. LaFA: lookahead finite automata for scalable regular expression detection. In Proc. ANCS, pages 40-49, 2009.
32. John J. Williams Jr. and Rina Panigrahy. DFA sequential matching of regular expression with divergent states. US Patent No.: 7689530 B1, 2010.