States constrain-based algorithm for large scale regular expression matching

By analysis of state explosion in deterministic finite automata DFA,a novel algorithm Group2-DFA based on state constrains was proposed to reduce the memory usage.With the state constrains,states in NFA were classified into several groups.Group2-DFA introduces two-level classification and merges NFA...

Full description

Saved in:
Bibliographic Details
Published inTongxin Xuebao Vol. 34; pp. 183 - 190
Main Authors Wei HE, Yun-fei GUO, Hong-chao HU
Format Journal Article
LanguageChinese
Published Editorial Department of Journal on Communications 01.10.2013
Subjects
regular expression;state explosion;automata convert;state constrains
Online AccessGet full text
ISSN1000-436X

Cover

More Information
Summary:By analysis of state explosion in deterministic finite automata DFA,a novel algorithm Group2-DFA based on state constrains was proposed to reduce the memory usage.With the state constrains,states in NFA were classified into several groups.Group2-DFA introduces two-level classification and merges NFA and DFA together to a hybrid FA construction.The experiments show that Group2-DFA can reduce memory usage efficiently and keep high throughput with a small increase of memory reading time.With 300 regex rules,Group2-DFA can cut 75% states and achieve 1Gbps throughput.
ISSN:1000-436X