A Memory Efficient Pattern Matching Scheme for Regular Expressions

Yeim Kuan Chang, Ching Hsuan Shih

Research output: Contribution to journalConference articlepeer-review

1 Citation (Scopus)

Abstract

Many malicious packets are common and spread over the Internet in recent years when the scale of Internet traffic grows at a rapid speed. Thus, the regular expression matching in Network Intrusion Detection System (NIDS) that supervises network activities needs to be very fast and consume small memory. In this paper, we propose a memory efficient regular expression matching algorithm called Failureless Segmented Finite Automata (FSFA) with an acceptable searching speed. In FSFA, We eliminate Kleene closures by using additional data structures to reduce a large amount of states. We further reduce the transitions by using default state compression technique. Our performance results implemented on a PC software environment show that our scheme only needs 1% of states needed in DFA and 2 to 22% of states needed in JFA.

Original languageEnglish
Pages (from-to)250-257
Number of pages8
JournalProcedia Computer Science
Volume110
DOIs
Publication statusPublished - 2017
Event14th International Conference on Mobile Systems and Pervasive Computing, MobiSPC 2017 - Leuven, Belgium
Duration: 2017 Jul 242017 Jul 26

All Science Journal Classification (ASJC) codes

  • Computer Science(all)

Fingerprint Dive into the research topics of 'A Memory Efficient Pattern Matching Scheme for Regular Expressions'. Together they form a unique fingerprint.

Cite this