research-article

Fast regular expression matching in hardware using NFA-BDD combination

Authors:

Danai Chasaki,

Tilman WolfAuthors Info & Claims

ANCS '10: Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Article No.: 12, Pages 1 - 2

https://doi.org/10.1145/1872007.1872022

Published: 25 October 2010 Publication History

Get Access

Abstract

The development of Network Intrusion Detection Systems (NIDS) is nowadays a powerful solution to defend against various network security threats. There has been a lot of research effort devoted to hardware-based NIDS, because of (1) the massive amount of computation performed by regular expression matching algorithms and (2) the gigabit per second performance requirement of modern NIDS. Hardware-based NIDS take advantage of parallelization inherent in FPGAs, ASICs or network processors to support very high network speeds, while software approaches fail to do so.

References

[1]

Faezipour, M., and Nourani, M. Constraint repetition inspection for regular expression on fpga. In High Performance Interconnects, 2008. HOTI '08. 16th IEEE Symposium on (26--28 2008), pp. 111--118.

Digital Library

Google Scholar

[2]

Sidhu, R., and Prasanna, V. Fast regular expression matching using fpgas. In Field-Programmable Custom Computing Machines, 2001. FCCM '01. The 9th Annual IEEE Symposium on (2001), pp. 227--238.

Digital Library

Google Scholar

[3]

Sinnappan, R. A. A reconfigurable approach to tcp/ip packet filtering, 2001.

Google Scholar

[4]

Sourdis, I., and Pnevmatikatos, D. Pre-decoded cams for efficient and high-speed nids pattern matching. In Field-Programmable Custom Computing Machines, 2004. FCCM 2004. 12th Annual IEEE Symposium on (2004).

Digital Library

Google Scholar

[5]

Yang, L., Karim, R., Ganapathy, V., and Smith, R. Improving nfa-based signature matching using ordered binary decision diagrams. In RAID'10: Proceedings of the 13th International Symposium on Recent Advances in Intrusion Detection (September 2010).

Digital Library

Google Scholar

[6]

Yusuf, S., and Luk, W. Bitwise optimised cam for network intrusion detection systems. In International Conference on Field Programmable Logic and Applications (2005).

Crossref

Google Scholar

Cited By

View all

Niemiec GBatista LSchaeffer-Filho ANazar G(2020)A Survey on FPGA Support for the Feasible Execution of Virtualized Network FunctionsIEEE Communications Surveys & Tutorials10.1109/COMST.2019.294369022:1(504-525)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.1109/COMST.2019.2943690
Yang LManadhata PHorne WRao PGanapathy VWolf TMoore APrasanna V(2012)Fast submatch extraction using OBDDsProceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems10.1145/2396556.2396594(163-174)Online publication date: 29-Oct-2012
https://dl.acm.org/doi/10.1145/2396556.2396594
Jiang KGuo HZhu SLan J(2012)Static patterns matching for high speed networksProceedings of the Third international conference on Information Computing and Applications10.1007/978-3-642-34062-8_2(15-22)Online publication date: 14-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-34062-8_2

Fast regular expression matching in hardware using NFA-BDD combination
1. Theory of computation

Recommendations

Fast, memory-efficient regular expression matching with NFA-OBDDs

Modern network intrusion detection systems (NIDS) employ regular expressions as attack signatures. Internally, NIDS represent and operate these regular expressions as finite automata. However, finite automata present a well-known time/space tradeoff. ...
Regular Expression Matching in Reconfigurable Hardware

In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three new basic building blocks to support constraint repetitions syntaxes more ...
A modular NFA architecture for regular expression matching
FPGA '10: Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays

We propose a non-deterministic finite automata (NFA) based architecture for regexp scanners on FPGA, called CES: the Character Class with Constraint Repetition (CCR) based regExp Scanner. CES is designed to realize a new MIN-MAX counting algorithm, ...

Comments

Information & Contributors

Information

Published In

ANCS '10: Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

October 2010

244 pages

ISBN:9781450303798

DOI:10.1145/1872007

General Chair:
Bill Lin
University of California, San Diego
,
Program Chairs:
Jeffrey Mogul
HP Labs
,
Ravishankar Iyer
Intel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 October 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Research-article

Conference

ANCS '10

Sponsor:

SIGCOMM
SIGARCH
IEEE-CS\TCCA

ANCS '10: Symposium on Architecture for Networking and Communications Systems

October 25 - 26, 2010

California, La Jolla

Acceptance Rates

Overall Acceptance Rate 88 of 314 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
189
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 27 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Niemiec GBatista LSchaeffer-Filho ANazar G(2020)A Survey on FPGA Support for the Feasible Execution of Virtualized Network FunctionsIEEE Communications Surveys & Tutorials10.1109/COMST.2019.294369022:1(504-525)Online publication date: 1-Jan-2020
https://dl.acm.org/doi/10.1109/COMST.2019.2943690
Yang LManadhata PHorne WRao PGanapathy VWolf TMoore APrasanna V(2012)Fast submatch extraction using OBDDsProceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems10.1145/2396556.2396594(163-174)Online publication date: 29-Oct-2012
https://dl.acm.org/doi/10.1145/2396556.2396594
Jiang KGuo HZhu SLan J(2012)Static patterns matching for high speed networksProceedings of the Third international conference on Information Computing and Applications10.1007/978-3-642-34062-8_2(15-22)Online publication date: 14-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-34062-8_2

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Abstract

References

Cited By

Recommendations

Fast, memory-efficient regular expression matching with NFA-OBDDs

Regular Expression Matching in Reconfigurable Hardware

A modular NFA architecture for regular expression matching

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Share

Share this Publication link

Share on social media

Affiliations