Abstract
To investigating high throughput pattern matching of regular expressions, This paper present a novel NFA-based architecture. In this paper, two theorems were proved and were used to prove the correctness of the algorithm. Our approach was based on three basic module to construct NFA which easily were reused in a FPGA or ASIC. Our approach is able to process many symbols per one clock cycle, and to run at high frequency. Due to FPGA constraints, the throughput of our approach achieved 512Gbps. The latency of our approach is lower than 2ns.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
SNORT Network Intrusion Detection System, www.snort.org
Lewis, H.R., Papadimitriou, C.H.: Elements of the theory of computation, 2nd edn. Prentic-Hall, Inc.
Floyd, R.W., Ullman, J.D.: The Compilation of Regular Expressions into Integrated Circuits. Journal of ACM 29(3), 603–622 (1982)
Sidhu, R., Prasanna, V.K.: Fast Regular Expression Matching Using FPGAs. In: Field-Programmable Custom Computing Machines (FCCM 2001), pp. 227–238 (2001)
Hutchings, B.L., Franklin, R., Carver, D.: Assisting Network Intrusion Detection with Reconfigurable Hardware. In: 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2002), p. 111 (2002)
Clark, C.R., Schimmel, D.E.: Scalable Pattern Matching for High Speed Networks. In: Field-Programmable Custom Computing Machines (FCCM 2004), pp. 249–257 (2004)
Brodie, B.C., Taylor, D.E., Cytron, R.K.: A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching. SIGARCH Comput. Archit. News 34(2), 191–202 (2006)
Lin, C.H., Huang, C.T., Jiang, C.P., Chang, S.C.: Optimization of Pattern Matching Circuits for Regular Expression on FPGA. IEEE Transactions on Very Large Scale Integration (VLSI) Systems 15(12), 1303–1310 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, K., Lan, J., Bu, Y. (2012). High Throughput Constraint Repetition for Regular Expression Matching Algorithm. In: Liu, B., Ma, M., Chang, J. (eds) Information Computing and Applications. ICICA 2012. Lecture Notes in Computer Science, vol 7473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34062-8_89
Download citation
DOI: https://doi.org/10.1007/978-3-642-34062-8_89
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34061-1
Online ISBN: 978-3-642-34062-8
eBook Packages: Computer ScienceComputer Science (R0)