Skip to main content

Synthesis of Regular Expressions Targeting FPGAs: Current Status and Open Issues

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4419))

Abstract

This paper presents an overview regarding the synthesis of regular expressions targeting FPGAs. It describes current solutions and a number of open issues. Implementation of regular expressions can be very challenging when performance is critical. Software implementations may not be able to satisfy performance requirements and thus dedicated hardware engines have to be used. In the later case, automatic synthesis tools are of paramount importance to achieve fast prototyping of regular expression engines. As a case study, experimental results are presented, for FPGA implementations of the regular expressions included in the rule-set of a Network Intrusion Detection System (NIDS), Bleeding Edge, obtained using a state-of-the-art synthesis approach.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kumar, S., et al.: Algorithms to accelerate multiple regular expressions matching for deep packet inspection. ACM SIGCOMM Computer Communication Review 36(4), 339–350 (2006)

    Article  Google Scholar 

  2. Snort official web site: http://www.snort.org , (Accessed last time on November 2006)

  3. Roesch, M.: Snort: Lightweight intrusion detection for networks. In: Proc. 13th Systems Administration Conference (LISA), USENIX Association, November 1999, pp. 229–238 (1999)

    Google Scholar 

  4. Bleeding Edge Threats web site: http://www.bleedingthreats.net , (Accessed last time on November 2006)

  5. Bispo, J., et al.: Regular Expression Matching for Reconfigurable Packet Inspection. In: IEEE International Conference on Field Programmable Technology (FPT’06), Bangkok Thailand, Dec. 13-15, 2006, pp. 119–126. IEEE Computer Society Press, Los Alamitos (2006)

    Chapter  Google Scholar 

  6. Floyd, R.W., Ullman, J.D.: The Compilation of Regular Expressions into Integrated Circuits. Journal of the ACM (JACM) 29(3), 603–622 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  7. Karlin, A.R., Trickey, H.W., Ullman, J.D.: Experience With A Regular Expression Compiler. In: Proceedings of the ICCD: VLSI in Computers (1983)

    Google Scholar 

  8. McNaughton, R., Yamada, H.: Regular Expressions and State Graphs for Automata. IEEE Transactions on Electronic Computers 9, 39–47 (1960)

    Article  Google Scholar 

  9. Sidhu, R., Prasanna, V.K.: Fast Regular Expression Matching using FPGAs. In: IEEE Symposium on Field-Programmable Custom Computing Machines, April 2001, IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  10. Franklin, R., Carver, D., Hutchings, B.: Assisting Network Intrusion Detection with Reconfigurable Hardware. In: IEEE Symposium on Field-Programmable Custom Computing Machines, April 2002, IEEE Computer Society Press, Los Alamitos (2002)

    Google Scholar 

  11. Moscola, J., et al.: Implementation of a Content-Scanning Module for an Internet Firewall. In: IEEE Symposium on Field-Programmable Custom Computing Machines, April 2003, IEEE Computer Society Press, Los Alamitos (2003)

    Google Scholar 

  12. Lin, C.-H., et al.: Optimization of regular expression pattern matching circuits on FPGA. In: Proceedings of the conference on Design, automation and test in Europe (DATE’06), pp. 12–17 (2006)

    Google Scholar 

  13. Perl Compatible Regular Expressions website: http://www.pcre.org/ , (Accessed last time on November 2006)

  14. Brodie, B.C., Taylor, D.E., Cytron, R.K.: A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching. In: 33rd International Symposium on Computer Architecture (ISCA’06), pp. 191–202 (2006)

    Google Scholar 

  15. Baker, Z.K., Jung, H.-J., Prasanna, V.K.: Regular Expression Software Deceleration For Intrusion Detection Systems. In: 16th International Conference on Field Programmable Logic and Applications (FPL’06) (2006)

    Google Scholar 

  16. Clark, C.R., Schimmel, D.E.: Scalable Parallel Pattern-Matching on High-Speed Networks. In: IEEE Symposium on Field-Programmable Custom Computing Machines, IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Pedro C. Diniz Eduardo Marques Koen Bertels Marcio Merino Fernandes João M. P. Cardoso

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Bispo, J., Sourdis, I., Cardoso, J.M.P., Vassiliadis, S. (2007). Synthesis of Regular Expressions Targeting FPGAs: Current Status and Open Issues. In: Diniz, P.C., Marques, E., Bertels, K., Fernandes, M.M., Cardoso, J.M.P. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2007. Lecture Notes in Computer Science, vol 4419. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71431-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71431-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71430-9

  • Online ISBN: 978-3-540-71431-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics