Efficient Regular Expression Grouping Algorithm Based on Label Propagation

DOI

10.2991/nceece-15.2016.188How to use a DOI?

Keywords

regular expression; deep packet inspection; grouping algorithm; label propagation.

Abstract

Regular expression grouping is the practical way to address the state explosion problem of Deterministic Finite Automaton (DFA). Previous grouping algorithms have poor grouping time, and difficult to meet application needs. In this work, we present an efficient regular expression grouping algorithm based on label propagation. Through the deterministic initial grouping and based on similarity of the propagation process to achieve faster convergence. Experimental results show that. Compared with other algorithms, GBLP algorithm has the minimum total number of states and grouping time for the same number of groups.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xi Chen
AU  - Shuqiao Chen
AU  - Ming Mao
PY  - 2015/12
DA  - 2015/12
TI  - Efficient Regular Expression Grouping Algorithm Based on Label Propagation
BT  - Proceedings of the 2015 4th National Conference on Electrical, Electronics and Computer Engineering
PB  - Atlantis Press
SP  - 1054
EP  - 1060
SN  - 2352-5401
UR  - https://doi.org/10.2991/nceece-15.2016.188
DO  - 10.2991/nceece-15.2016.188
ID  - Chen2015/12
ER  -