Sciweavers

42 search results - page 1 / 9
» An improved DFA for fast regular expression matching
Sort
View
CCR
2008
131views more  CCR 2008»
13 years 3 months ago
An improved DFA for fast regular expression matching
Domenico Ficara, Stefano Giordano, Gregorio Procis...
ANCS
2007
ACM
13 years 7 months ago
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
Sailesh Kumar, Balakrishnan Chandrasekaran, Jonath...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 3 months ago
Reorganized and Compact DFA for Efficient Regular Expression Matching
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
Kai Wang, Yaxuan Qi, Yibo Xue, Jun Li
SIGCOMM
2006
ACM
13 years 9 months ago
Algorithms to accelerate multiple regular expressions matching for deep packet inspection
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...
Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patr...
ANCS
2006
ACM
13 years 9 months ago
Advanced algorithms for fast and scalable deep packet inspection
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...
Sailesh Kumar, Jonathan S. Turner, John Williams