Journal ArticleDOI
A pipelined processor architecture for regular expression string matching
TLDR
This special purpose processor is a parallel and pipelined architecture which can deal with the regular expression semantics and can achieve 200-400 times speedup over traditional CPU implementations and up to 7.9Gbps in processing throughput.About:
This article is published in Microprocessors and Microsystems.The article was published on 2012-08-01. It has received 3 citations till now. The article focuses on the topics: ReDoS & String searching algorithm.read more
Citations
More filters
Journal ArticleDOI
An Efficient Composite-Alphabet Transform for String Matching under a Restricted Alphabet Set
TL;DR: This paper empirically compare various configurations of composite alphabets using FM-index, and shows how they affect the performance in terms of the number of false positives and the searching time.
Journal ArticleDOI
Regular Expression Matching Processor Architecture Supporting Character Class Matching
TL;DR: The proposed instruction set and architecture of a regular expression matching processor can efficiently perform character class matching since it includes character class, character range, and negated characterclass matching capabilities.
Proceedings ArticleDOI
Efficient failure processing architecture in regular expression processor
TL;DR: The proposed architecture uses the failure bit included in instruction format and provides efficient failure processing by removing unnecessary data backtracking in regular expression processor.
References
More filters
Book ChapterDOI
Toward the accurate identification of network applications
TL;DR: This work uses a full payload packet trace collected from an Internet site to identify the types of errors that may result from port-based classification and quantify them for the specific trace under study and devise a classification methodology that relies on the full packet payload.
Proceedings ArticleDOI
Fast Regular Expression Matching Using FPGAs
TL;DR: An efficient method for finding matches to a given regular expression in given text using FPGAs using the Nondetermineistic Finite Automaton, the first prctical use of a nondeterministic state machine on programmable logic.
Book
Mastering Regular Expressions
TL;DR: Mastering Regular Expressions, Third Edition, now includes a full chapter devoted to PHP and its powerful and expressive suite of regular expression functions, in addition to enhanced PHP coverage in the central "core" chapters.
Proceedings ArticleDOI
Deterministic memory-efficient string matching algorithms for intrusion detection
TL;DR: This work contributes modifications to the Aho-Corasick string-matching algorithm that drastically reduce the amount of memory required and improve its performance on hardware implementations, and shows that these modifications do not drastically affect software performance on commodity processors, and therefore may be worth considering in these cases.
Proceedings ArticleDOI
Regular expression matching for reconfigurable packet inspection
TL;DR: A nondeterministic finite automata (NFA) based implementation was presented, which takes advantage of new basic building blocks to support more complex regular expressions than the previous approaches.