An Effective Pattern Matching Algorithm for Intrusion Detection

Feng Du · 2012

In this paper, 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. Experiments indicate that the space complexity is reduced by 36% at most. Therefore, the improved algorithm can provide significant improvement in pattern matching performance when using in an IDS.

Read the paper · More papers on PaperTik