The Community for Technology Leaders
RSS Icon
Issue No.07 - July (2012 vol.61)
pp: 1013-1025
Yi-Hua Edward Yang , University of Southern California, Los Angeles
Viktor K. Prasanna , University of Southern California, Los Angeles
We present the design, implementation and evaluation of a high-performance architecture for regular expression matching (REM) on field-programmable gate array (FPGA). Each regular expression (regex) is first parsed into a concise token list representation, then compiled to a modular nondeterministic finite automaton (RE-NFA) using a modified version of the McNaughton-Yamada algorithm. The RE-NFA can be mapped directly onto a compact register-transistor level (RTL) circuit. A number of optimizations are applied to improve the circuit performance: 1) spatial stacking is used to construct an REM circuit processing m\ge 1 input characters per clock cycle; 2) single-character constrained repetitions are matched efficiently by parallel shift-register lookup tables; 3) complex character classes are matched by a BRAM-based classifier shared across regexes; 4) a multipipeline architecture is used to organize a large number of RE-NFAs into priority groups to limit the I/O size of the circuit. We implemented 2,630 unique PCRE regexes from Snort rules (February 2010) in the proposed REM architecture. Based on the place-and-route results from Xilinx ISE 11.1 targeting Virtex5 LX-220 FPGAs, the proposed REM architecture achieved up to 11 Gbps concurrent throughput for various regex sets and up to 2.67x the throughput efficiency of other state-of-the-art designs.
Regular expression, NFA, finite state machine, network intrusion detection, FPGA, BRAM, LUT, SRL.
Yi-Hua Edward Yang, Viktor K. Prasanna, "High-Performance and Compact Architecture for Regular Expression Matching on FPGA", IEEE Transactions on Computers, vol.61, no. 7, pp. 1013-1025, July 2012, doi:10.1109/TC.2011.129
[1] “Bro Intrusion Detection System,” http:/, 2011.
[2] “SNORT,” http:/, 2011.
[3] R. Smith, C. Estan, and S. Jha, “Backtracking Algorithmic Complexity Attacks against a NIDS,” Proc. 22nd Ann. Computer Security Applications Conf. (ACSAC), pp. 89-98, Dec. 2006.
[4] J. Bispo, I. Sourdis, J.M.P. Cardoso, and S. Vassiliadis, “Regular Expression Matching for Reconfigurable Packet Inspection,” Proc. IEEE Int'l Conf. Field Programmable Technology (FPT), pp. 119-126, Dec. 2006.
[5] B.L. Hutchings, R. Franklin, and D. Carver, “Assisting Network Intrusion Detection with Reconfigurable Hardware,” Proc. IEEE 10th Ann. Symp. Field-Programmable Custom Computing Machines (FCCM), pp. 111-120, 2002.
[6] A. Mitra, W. Najjar, and L. Bhuyan, “Compiling PCRE to FPGA for Accelerating SNORT IDS,” Proc. ACM/IEEE Symp. Architecture for Networking and Comm. Systems (ANCS), pp. 127-136, 2007.
[7] R. Sidhu and V. Prasanna, “Fast Regular Expression Matching Using FPGAs,” Proc. IEEE Symp. Field-Programmable Custom Computing Machines (FCCM), pp. 227-238, 2001.
[8] N. Yamagaki, R. Sidhu, and S. Kamiya, “High-Speed Regular Expression Matching Engine Using Multi-Character NFA,” Proc. Int'l Conf. Field Programmable Logic and Applications (FPL), pp. 697-701, Aug. 2008.
[9] C.-H. Lin, C.-T. Huang, C.-P. Jiang, and S.-C. Chang, “Optimization of Regular Expression Pattern Matching Circuits on FPGA,” Proc. Conf. Design, Automation and Test in Europe (DATE), pp. 12-17, 2006.
[10] M. Becchi and P. Crowley, “An Improved Algorithm to Accelerate Regular Expression Evaluation,” Proc. ACM/IEEE Symp. Architecture for Networking and Communications Systems (ANCS), pp. 145-154, 2007.
[11] S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese, “Curing Regular Expressions Matching Algorithms from Insomnia, Amnesia, and Acalculia,” Proc. ACM/IEEE Symp. Architecture for Networking and Comm. Systems (ANCS), pp. 155-164, 2007.
[12] S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner, “Algorithms to Accelerate Multiple Regular Expressions Matching for Deep Packet Inspection,” SIGCOMM Computer Comm. Rev., vol. 36, no. 4, pp. 339-350, 2006.
[13] R. Smith, C. Estan, and S.J.S. Kong, “Deflating the Big Bang: Fast and Scalable Deep Packet Inspection with Extended Finite Automata,” Proc. ACM SIGCOMM, Aug. 2008.
[14] A.R. Meyer and M.J. Fischer, “Economy of Description by Automata, Grammars, and Formal Systems,” Proc. 12th Symp. Switching and Automata Theory (SWAT '71). pp. 188-191, 1971.
[15] F. Yu, Z. Chen, Y. Diao, T.V. Lakshman, and R.H. Katz, “Fast and Memory-Efficient Regular Expression Matching for Deep Packet Inspection,” Proc. ACM/IEEE Symp. Architecture for Networking and Comm. Systems (ANCS), pp. 93-102, 2006.
[16] R.W. Floyd and J.D. Ullman, “The Compilation of Regular Expressions into Integrated Circuits,” J. ACM, vol. 29, no. 3, pp. 603-622, 1982.
[17] A.V. Aho and J.D. Ullman, The Theory of Parsing, Translation, and Compiling. Prentice-Hall, Inc., 1972.
[18] “PCRE: Perl Compatible Regular Expression.” http:/www., 2011.
[19] R. McNaughton and H. Yamada, “Regular Expressions and State Graphs for Automata,” IEEE Trans. Electronic Computers, vol. 9, no. 1, pp. 39-47, Mar. 1960.
[20] I. Sourdis, S. Vassiliadis, J. Bispo, and J.M.P. Cardoso, “Regular Expression Matching in Reconfigurable Hardware,” J. Signal Processing Systems, vol. 51, pp. 99-121, 2008.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool