Hierarchical state machine architecture for regular expression pattern matching

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

Abstract

Regular expression has been widely used in network intrusion detection system to represent attack patterns due to its expressive power and flexibility. However, the traditional memory architecture suffers from the problem of memory explosion for certain types of complex regular expressions. In this paper, we propose a hierarchical state machine architecture which can significantly reduce the memory required to accommodate complex regular expression patterns. The experiments demonstrate a significant reduction in memory for the complex regular expression patterns commonly used in network intrusion detection systems.

Original languageEnglish
Title of host publicationGLSVLSI 2009 - Proceedings of the 2009 Great Lakes Symposium on VLSI
Pages133-136
Number of pages4
DOIs
Publication statusPublished - 2009 Nov 6
Event19th ACM Great Lakes Symposium on VLSI, GLSVLSI '09 - Boston, MA, United States
Duration: 2009 May 102009 May 12

Publication series

NameProceedings of the ACM Great Lakes Symposium on VLSI, GLSVLSI

Other

Other19th ACM Great Lakes Symposium on VLSI, GLSVLSI '09
CountryUnited States
CityBoston, MA
Period09/5/1009/5/12

Keywords

  • Pattern matching
  • Regular expression
  • State machine

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Hierarchical state machine architecture for regular expression pattern matching'. Together they form a unique fingerprint.

Cite this