Skip to main content
SpringerLink
Log in

Regular Expression Pattern Matching Supporting Constrained Repetitions

  • Conference paper
Book cover Reconfigurable Computing: Architectures, Tools and Applications (ARC 2009)

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

Included in the following conference series:

Abstract

In this paper we present regular expression pattern matching architecture supporting constrained repetitions. The proposed architecture can implement the constrained repetitions of a regular expression while previous works support only the constrained repetitions of a single character or a multi-cycle, fixed length pattern. The blocks for the constrained repetitions are simply implemented using a counter. The beginning constrained repetition blocks are implemented differently from the non-beginning blocks to support overlapped matching. The proposed architecture can implement all constrained repetitions used in Snort rule-sets with smaller resources.

This work was supported by the Korea Research Foundation Grant funded by the Korean Government (KRF-2008-521-D00446).

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

Access this chapter

Log in via an institution
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Sidhu, R., Prasanna, V.K.: Fast regular expression matching using FPGAs. In: IEEE Symp. Field Prog. Custom Comput. Machines (FCCM 2001), pp. 227–238 (2001)

    Google Scholar 

  2. PCRE: Perl compatible regular expressions, http://www.pcre.org

  3. Hutchings, B.L., Franklin, R., Carver, D.: Assisting network intrusion detection with reconfigurable hardware. In: IEEE Symp. Field Prog. Custom Comput. Machines (FCCM 2002), pp. 111–120 (2002)

    Google Scholar 

  4. Sutton, P.: Partial character decoding for improved regular expression matching in fpgas. In: Int. Conf. Field-Programmable Logic and App (FPL 2006), pp. 25–32 (2004)

    Google Scholar 

  5. Lin, C.H., Huang, C.T., Jiang, C.P., Chang, S.C.: Optimization of regular expression pattern matching circuits on FPGA. In: Conf. Design, Automation and Test in Europe (DATE 2006), pp. 12–17 (2006)

    Google Scholar 

  6. Bispo, J.C., Sourdis, I., Cardoso, J.M., Vassiliadis, S.: Regular expression matching for reconfigurable packet inspection. In: IEEE Int. Conf. Field Programmable Technology (FPT 2006), pp. 119–126 (2006)

    Google Scholar 

  7. Sourdis, I., Vassiliadis, S., Bispo, J.C., Cardoso, J.M.: Regular expression matching in reconfigurable hardware. J. Signal Processing Systems 51(1), 99–121 (2008)

    Article  Google Scholar 

  8. Bispo, J., Sourdis, I., Cardoso, J.M.P., Vassiliadis, S.: 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.) ARCS 2007. LNCS, vol. 4419, pp. 179–190. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Bispo, J., Cardoso, J.M.: Synthesis of regular expressions for FPGAs. Int. J Electronics 95(7), 685–704 (2008)

    Article  Google Scholar 

  10. Sourcefire: SNORT official web site, http://www.snort.org

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Telecommunications Engineering, Yonsei University, Wonju, Gangwon, 220-710, Korea

    SangKyun Yun & KyuHee Lee

Authors
  1. SangKyun Yun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. KyuHee Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Technik der Informationsverarbeitung (ITIV), Universität Karlsruhe (TH), 76128, Karlsruhe, Germany

    Jürgen Becker

  2. ECIT Institute, Queen’s University Belfast, Queen’s Road, Queen’s Island, BT3 9DT, Belfast, UK

    Roger Woods

  3. Bradley Department of Electrical and Electronic Engineering, Virginia Tech, 302 Whittemore (0111), 24061, Blacksburg, VA, USA

    Peter Athanas

  4. Department of Electronic Engineering, National University of Ireland, Galway, Ireland

    Fearghal Morgan

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yun, S., Lee, K. (2009). Regular Expression Pattern Matching Supporting Constrained Repetitions. In: Becker, J., Woods, R., Athanas, P., Morgan, F. (eds) Reconfigurable Computing: Architectures, Tools and Applications. ARC 2009. Lecture Notes in Computer Science, vol 5453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00641-8_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00641-8_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00640-1

  • Online ISBN: 978-3-642-00641-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation