A high effective papilionaceous automata to match multiple counting constraint pattern

Author

Rong-cai, Zhao ; Shuo, Zhang ; Peng, Liu ; Li, Zhou

Author_Institution

Dept. of Comput. & Sci., China Nat. Digital Switching Syst. Center (NDSC), Zhengzhou, China

fYear

2011

fDate

27-29 May 2011

Firstpage

21

Lastpage

24

Abstract

Regular expression matching is a key technology of network security. Around this issue, one of the regular expression patterns in real rule sets called counting constraint pattern is analyzed in this paper. Besides, the complex characteristics of counting constrain pattern syntax and the problems of state explosion lead by patterns composition are studied. Based on the analysis of the limitations of existing matching algorithms, aimed at the multiple counting constraint pattern composition, a papilionaceous automata applied to deep packet inspection is proposed. The results show that the compression ratio could reach 94.86% in Linux L7-filter rule sets, and for the majority of Bro rule sets and Snort rule sets, the compression ratio could up to 99%.

Keywords

automata theory; computer network security; knowledge engineering; pattern matching; Bro rule sets; Linux L7-filter rule sets; Snort rule sets; constrain pattern syntax; deep packet inspection; existing matching algorithms; multiple counting constraint pattern composition; network security; papilionaceous automata; patterns composition; real rule sets; regular expression matching; regular expression patterns; state explosion; Doped fiber amplifiers; Explosions; Fires; Matched filters; Pattern matching; Security; Counting Constraint Pattern; Deep Packet Inspection; Regular Expression; State Explosion;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Software and Networks (ICCSN), 2011 IEEE 3rd International Conference on

Conference_Location

Xi´an

Print_ISBN

978-1-61284-485-5

Type

conf

DOI

10.1109/ICCSN.2011.6014209

Filename

6014209