A Memory Efficient Pattern Matching Scheme for Regular Expressions

Yeim Kuan Chang, Ching Hsuan Shih

研究成果: Conference article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)250-257
頁數8
期刊Procedia Computer Science
110
DOIs
出版狀態Published - 2017
事件14th International Conference on Mobile Systems and Pervasive Computing, MobiSPC 2017 - Leuven, Belgium
持續時間: 2017 七月 242017 七月 26

All Science Journal Classification (ASJC) codes

  • 電腦科學(全部)

指紋

深入研究「A Memory Efficient Pattern Matching Scheme for Regular Expressions」主題。共同形成了獨特的指紋。

引用此