Efficient pattern matching algorithm for security and Binary Search Tree (BST) based memory system in Wireless Intrusion Detection System (WIDS)

2020 ◽  
Vol 151 ◽  
pp. 111-118 ◽  
Author(s):  
P. Suresh ◽  
R. Sukumar ◽  
S. Ayyasamy
Keyword(s):  
Intrusion Detection ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Detection System ◽  
Search Tree ◽  
Memory System ◽  
Binary Search ◽  
Binary Search Tree ◽  
Matching Algorithm ◽  
Pattern Matching Algorithm

An Improved Pattern Matching Algorithm in the Intrusion Detection System

2011 ◽  
Vol 48-49 ◽  
pp. 203-207 ◽  
Author(s):  
Ping Zhang ◽  
Jiang Hui Liu
Keyword(s):  
Intrusion Detection ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Detection System ◽  
Typical Pattern ◽  
Matching Algorithm ◽  
Pattern Matching Algorithm

This paper proposed a matching algorithm FBMH(Fast Boyer Moor Horspool),which made an improvement on the BMH(Boyer Moor Horspool) and BMHS(Boyer Moor Horspool Sundy) matching algorithm based on the study of several typical pattern matching algorithms used in intrusion detection. The result shows that, the FBMH algorithm has less intrusion detection matching time than BMH and BMHS algorithm. The FBMH algorithm accelerated the speed of pattern matching effectively, therefore enhanced the efficiency of the intrusion detection system.

An Effective Pattern Matching Algorithm for Intrusion Detection

2014 ◽  
Vol 556-562 ◽  
pp. 3010-3013
Author(s):  
Qing Qing Zhang ◽  
Qian Zhang ◽  
Yue Jiang Feng
Keyword(s):  
Intrusion Detection ◽  
Pattern Matching ◽  
Intrusion Detection System ◽  
Time Complexity ◽  
Detection System ◽  
Space Complexity ◽  
Experiment Data ◽  
Matching Algorithm ◽  
Bm Algorithm ◽  
Pattern Matching Algorithm

This paper makes a summary of pattern matching algorithm in Intrusion Detection System: KMP algorithm, BM algorithm and BMH algorithm algorithm. The performances of various algorithms are analyzed, and then through the experiment data is verified. Last an improved algorithm based on the BM algorithm: BMD is proposed. BMD algorithm can reduce the space complexity and maintain the time complexity by reducing a pretreatment function and recording the number of times that a bad char found in the pattern.

Sign in / Sign up

Export Citation Format

Share Document