Regular Expression Matching in Reconfigurable Hardware

Authors:
Ioannis Sourdis;João Bispo;João M. Cardoso;Stamatis Vassiliadis
Affiliations:
Computer Engineering, TU Delft, Delft, The Netherlands;INESC-ID, Lisboa, Portugal;Department of Informatics Engineering, IST/UTL, Lisboa, Portugal;Computer Engineering, TU Delft, Delft, The Netherlands
Venue:
Journal of Signal Processing Systems
Year:
2008

Citing 22
Cited 14

From regular expressions to deterministic automata

Theoretical Computer Science
Avoiding Latch Formation in Regular Expression Recognizers

IEEE Transactions on Computers
The Compilation of Regular Expressions into Integrated Circuits

Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Reconfigurable computing: a survey of systems and software

ACM Computing Surveys (CSUR)
Introduction to Automata Theory, Languages and Computability

Introduction to Automata Theory, Languages and Computability
Assisting Network Intrusion Detection with Reconfigurable Hardware

FCCM '02 Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Fast Content-Based Packet Handling for Intrusion Detection

Fast Content-Based Packet Handling for Intrusion Detection
Implementation of a Content-Scanning Module for an Internet Firewall

FCCM '03 Proceedings of the 11th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
The MOLEN Polymorphic Processor

IEEE Transactions on Computers
A Methodology for Synthesis of Efficient Intrusion Detection Systems on FPGAs

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Scalable Pattern Matching for High Speed Networks

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Pre-Decoded CAMs for Efficient and High-Speed NIDS Pattern Matching

FCCM '04 Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Snort - Lightweight Intrusion Detection for Networks

LISA '99 Proceedings of the 13th USENIX conference on System administration
Fast Regular Expression Matching Using FPGAs

FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Optimization of regular expression pattern matching circuits on FPGA

Proceedings of the conference on Design, automation and test in Europe: Designers' forum
A Scalable Architecture For High-Throughput Regular-Expression Pattern Matching

Proceedings of the 33rd annual international symposium on Computer Architecture
Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
A Scalable Hybrid Regular Expression Pattern Matcher

FCCM '06 Proceedings of the 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
Advanced algorithms for fast and scalable deep packet inspection

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Fast and memory-efficient regular expression matching for deep packet inspection

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
Packet pre-filtering for network intrusion detection

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems

Compiling PCRE to FPGA for accelerating SNORT IDS

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Design of high performance pattern matching engine through compact deterministic finite automata

Proceedings of the 45th annual Design Automation Conference
Regular Expression Pattern Matching Supporting Constrained Repetitions

ARC '09 Proceedings of the 5th International Workshop on Reconfigurable Computing: Architectures, Tools and Applications
Memory-efficient distribution of regular expressions for fast deep packet inspection

CODES+ISSS '09 Proceedings of the 7th IEEE/ACM international conference on Hardware/software codesign and system synthesis
A modular NFA architecture for regular expression matching

Proceedings of the 18th annual ACM/SIGDA international symposium on Field programmable gate arrays
A NFA-based programmable regular expression match engine

Proceedings of the 5th ACM/IEEE Symposium on Architectures for Networking and Communications Systems
PeRex: A Power Efficient FPGA-based Architecture for Regular Expression Matching

GREENCOM '11 Proceedings of the 2011 IEEE/ACM International Conference on Green Computing and Communications
Pattern-unit based regular expression matching with reconfigurable function unit

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
String alignment pre-detection using unique subsequences for FPGA-based network intrusion detection

Computer Communications
Automatic generation of regular expressions from examples with genetic programming

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Designing a Programmable Wire-Speed Regular-Expression Matching Accelerator

MICRO-45 Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture
GPU acceleration of regular expression matching for large datasets: exploring the implementation space

Proceedings of the ACM International Conference on Computing Frontiers
An automatic tool flow for the combined implementation of multi-mode circuits

Proceedings of the Conference on Design, Automation and Test in Europe
Exploring the design space of programmable regular expression matching accelerators

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 efficiently than previous works. In addition, a number of optimization techniques are employed to reduce the area cost of the designs and maximize performance. Our design methodology is supported by a tool that automatically generates the circuitry for the given regular expressions and outputs Hardware Description Language representations ready for logic synthesis. The proposed approach is evaluated on network Intrusion Detection Systems (IDS). Recent IDS use regular expressions to represent hazardous packet payload contents. They require high-speed packet processing providing a challenging case study for pattern matching using regular expressions. We use a number of IDS rulesets to show that our approach scales well as the number of regular expressions increases, and present a step-by-step optimization to survey the benefits of our techniques. The synthesis tool described in this study is used to generate hardware engines to match 300 to 1,500 IDS regular expressions using only 10---45 K logic cells and achieving throughput of 1.6---2.2 and 2.4---3.2 Gbps on Virtex2 and Virtex4 devices, respectively. Concerning the throughput per area required per matching non-Meta character, our hardware engines are 10---20脳 more efficient than previous Field Programmable Gate Array approaches. Furthermore, the generated designs have comparable area requirements to current application-specific integrated circuit solutions.