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%.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
