Sciweavers

Share
40 search results - page 1 / 8
» A NFA-based programmable regular expression match engine
Sort
View
ANCS
2009
ACM
9 years 9 months ago
A NFA-based programmable regular expression match engine
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
Derek Pao
ANCS
2007
ACM
10 years 3 months ago
Compiling PCRE to FPGA for accelerating SNORT IDS
Deep Payload Inspection systems like SNORT and BRO utilize regular expression for their rules due to their high expressibility and compactness. The SNORT IDS system uses the PCRE ...
Abhishek Mitra, Walid A. Najjar, Laxmi N. Bhuyan
ARC
2011
Springer
270views Hardware» more  ARC 2011»
9 years 6 months ago
A Regular Expression Matching Circuit Based on a Decomposed Automaton
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
Hiroki Nakahara, Tsutomu Sasao, Munehiro Matsuura
RECONFIG
2008
IEEE
224views VLSI» more  RECONFIG 2008»
10 years 6 months ago
Automatic Construction of Large-Scale Regular Expression Matching Engines on FPGA
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...
Yi-Hua E. Yang, Viktor K. Prasanna
FPL
2008
Springer
178views Hardware» more  FPL 2008»
10 years 1 months ago
High-speed regular expression matching engine using multi-character NFA
An approach is presented for high throughput matching of regular expressions (regexes) by first converting them into corresponding Non-deterministic Finite Automata (NFAs) which a...
Norio Yamagaki, Reetinder P. S. Sidhu, Satoshi Kam...
books