Fast Algorithm for Pattern Matching in Intrusion Detection System
Kelei Sun
Abstract
Kelei Sun
Abstract
The performance efficiency of a network intrusion detection system(NIDS) is dominated by pattern matching algorithm.This paper analyses the most popular BM algorithm on the network at present and its shortcomings.Then a further advanced algorithm is introduced here,which uses the matched data information to increase the right shift of bad characters and improve the efficiency of the pattern matching.The result of the experiment shows that this algorithm available is able to accelerate the detecting velocity of NIDS.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The performance efficiency of a network intrusion detection system(NIDS) is dominated by pattern matching algorithm.This paper analyses the most popular BM algorithm on the network at present and its shortcomings.Then a further advanced algorithm is introduced here,which uses the matched data information to increase the right shift of bad characters and improve the efficiency of the pattern matching.The result of the experiment shows that this algorithm available is able to accelerate the detecting velocity of NIDS.
Key concepts: Intrusion detection system, Matching (statistics), Pattern matching, Computer science, Blossom algorithm, Algorithm, Intrusion, String searching algorithm