By Topic

Improved BM Pattern Matching Algorithm for Intrusion Detection

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Qingzhang Chen ; Coll. of Comput., Zhejiang Univ. of Technol., Hangzhou, China ; Yibo Niu ; Zhehu Wang ; Feng Du

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

Published in:

Computational Science and Optimization (CSO), 2010 Third International Joint Conference on  (Volume:1 )

Date of Conference:

28-31 May 2010