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.
|頁（從 - 到）||250-257|
|期刊||Procedia Computer Science|
|出版狀態||Published - 2017|
|事件||14th International Conference on Mobile Systems and Pervasive Computing, MobiSPC 2017 - Leuven, Belgium|
持續時間: 2017 七月 24 → 2017 七月 26
All Science Journal Classification (ASJC) codes