10 search results - page 1 / 2 » Fast and memory-efficient regular expression matching for de... |
ANCS
2006
ACM
13 years 10 months ago
2006
ACM
ANCS
2006
ACM
13 years 10 months ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
SIGCOMM
2006
ACM
13 years 10 months ago
2006
ACM
There is a growing demand for network devices capable of examining the content of data packets in order to improve network security and provide application-specific services. Most...
IISWC
2008
IEEE
13 years 11 months ago
2008
IEEE
—High-speed content inspection of network traffic is an important new application area for programmable networking systems, and has recently led to several proposals for high-per...
CONEXT
2007
ACM
13 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...