Sciweavers

3 search results - page 1 / 1
» Space-time tradeoff in regular expression matching with semi...
Sort
View
INFOCOM
2011
IEEE
12 years 8 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna
ANCS
2007
ACM
13 years 8 months ago
An improved algorithm to accelerate regular expression evaluation
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
Michela Becchi, Patrick Crowley
GLOBECOM
2010
IEEE
13 years 2 months ago
Cache-Based Scalable Deep Packet Inspection with Predictive Automaton
Abstract--Regular expression (Regex) becomes the standard signature language for security and application detection. Deterministic finite automata (DFAs) are widely used to perform...
Yi Tang, Junchen Jiang, Xiaofei Wang, Yi Wang, Bin...