Compressing regular expressions' DFA table by matrix decomposition

Authors:
Yanbing Liu;Li Guo;Ping Liu;Jianlong Tan
Affiliations:
Institute of Computing Technology, Chinese Academy of Sciences and Graduate School of Chinese Academy of Sciences and National Engineering Laboratory for Information Security Technologies, Beijing;Institute of Computing Technology, Chinese Academy of Sciences and National Engineering Laboratory for Information Security Technologies, Beijing;Institute of Computing Technology, Chinese Academy of Sciences and National Engineering Laboratory for Information Security Technologies, Beijing;Institute of Computing Technology, Chinese Academy of Sciences and National Engineering Laboratory for Information Security Technologies, Beijing
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 13
Cited 1

A Four Russians algorithm for regular expression pattern matching

Journal of the ACM (JACM)
Fast text searching for regular expressions or automaton searching on tries

Journal of the ACM (JACM)
Space/time trade-offs in hash coding with allowable errors

Communications of the ACM
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Fast and simple character classes and bounded gaps pattern matching, with application to protein searching

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
Compact DFA Representation for Fast Regular Expression Search

WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Algorithms to accelerate multiple regular expressions matching for deep packet inspection

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Fast and memory-efficient regular expression matching for deep packet inspection

Proceedings of the 2006 ACM/IEEE symposium on Architecture for networking and communications systems
An improved algorithm to accelerate regular expression evaluation

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia

Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
Scalable regular expression matching on data streams

Proceedings of the 2008 ACM SIGMOD international conference on Management of data
XFA: Faster Signature Matching with Extended Automata

SP '08 Proceedings of the 2008 IEEE Symposium on Security and Privacy
An improved DFA for fast regular expression matching

ACM SIGCOMM Computer Communication Review

SDFA: series DFA for memory-efficient regular expression matching

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently regular expression matching has become a research focus as a result of the urgent demand for Deep Packet Inspection (DPI) in many network security systems. Deterministic Finite Automaton (DFA), which recognizes a set of regular expressions, is usually adopted to cater to the need for real-time processing of network traffic. However, the huge memory usage of DFA prevents it from being applied even on a mediumsized pattern set. In this article,we propose amatrix decompositionmethod for DFA table compression. The basic idea of the method is to decompose a DFA table into the sum of a row vector, a column vector and a sparse matrix, all of which cost very little space. Experiments on typical rule sets show that the proposed method significantly reduces the memory usage and still runs at fast searching speed.