Improved BM Pattern Matching Algorithm for Intrusion Detection

In the paper, two improved algorithms: BMLT and BMLS are proposed, in which the time complexity and space complexity of BM is improved. The algorithm of BMLT with a new pre-calculation function can increase in the movement of pattern significantly. The algorithm of BMLS can reduce the space complexi...

Full description

Saved in:
Bibliographic Details
Published in2010 Third International Joint Conference on Computational Sciences and Optimization Vol. 1; pp. 440 - 444
Main Authors Qingzhang Chen, Yibo Niu, Zhehu Wang, Feng Du
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
algorithm improvement
BM-algorithm
Computer networks
Computer security
Costs
Data security
Educational institutions
Information security
Intrusion detection
network security
Paper technology
Pattern matching
Space technology
Online AccessGet full text
ISBN1424468124
9781424468126
DOI10.1109/CSO.2010.177

Cover

More Information
Summary:In the paper, two improved algorithms: BMLT and BMLS are proposed, in which the time complexity and space complexity of BM is improved. The algorithm of BMLT with a new pre-calculation function can increase in the movement of pattern significantly. The algorithm of BMLS 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 time complexity is reduced by 60% and the space complexity is reduced by 26% at most. Therefore, the improved algorithms can provide significant improvement in pattern matching performance when using in an IDS.
ISBN:1424468124
9781424468126
DOI:10.1109/CSO.2010.177