Efficient regular expression evaluation
Authors:
Open Access
- 6 November 2008
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 50-59
Abstract
Several algorithms and techniques have been proposed recently to accelerate regular expression matching and enable deep packet inspection at line rate. This work aims to provide a comprehensive practical evaluation of existing techniques, extending them and analyzing their compatibility. The study focuses on two hardware architectures: memory-based ASICs and FPGAs.Keywords
Funding Information
- Division of Computing and Communication Foundations (CCF-0430012CCF-0427794)
This publication has 14 references indexed in Scilit:
- XFA: Faster Signature Matching with Extended Automata2008 IEEE Symposium on Security and Privacy (SP 2008), 2008
- Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia2007
- Compiling PCRE to FPGA for accelerating SNORT IDS2007
- An improved algorithm to accelerate regular expression evaluation2007
- A hybrid finite automaton for practical deep packet inspection2007
- Fast and memory-efficient regular expression matching for deep packet inspection2006
- Advanced algorithms for fast and scalable deep packet inspection2006
- Algorithms to accelerate multiple regular expressions matching for deep packet inspection2006
- Enhancing byte-level network intrusion detection signatures with context2003
- Efficient Reconfigurable Logic Circuits for Matching Complex Network Intrusion Detection Patterns2003