Sciweavers

39 search results - page 1 / 8
» Fast Bit-Parallel Matching for Network and Regular Expressio...
Sort
View
SPIRE
2010
Springer
13 years 2 months ago
Fast Bit-Parallel Matching for Network and Regular Expressions
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...
Yusaku Kaneta, Shin-ichi Minato, Hiroki Arimura
ANCS
2006
ACM
13 years 10 months ago
Fast and memory-efficient regular expression matching for deep packet inspection
Fang Yu, Zhifeng Chen, Yanlei Diao, T. V. Lakshman...
ICC
2011
IEEE
237views Communications» more  ICC 2011»
12 years 4 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
ANCS
2007
ACM
13 years 8 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...
ANCS
2009
ACM
13 years 2 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