An Improved Pattern Matching Algorithm in the Intrusion Detection System

Article Preview

Abstract:

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.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

203-207

Citation:

Online since:

February 2011

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2011 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Yan Weimin,Wu Weimin. Data Structure [M]. Beijing:Tsinghua University Press, (1996).

Google Scholar

[2] Goodrich,M. T,Tamassia,R. Algorithm Analysis and Design [M]. Beijing:People Posts and Telecommunications Press, (2006).

Google Scholar

[3] Booyer-Moore algorithm. http: /www-igm. univ-mlv. fr/~lecroq/string/node14. html.

Google Scholar

[4] NIGEL-HORSPOOL R. Pratical fast searching in string[J]. Software practice and Experience, 1980, 10(6): 501-506.

Google Scholar

[5] Qian Yi, Hou Yibin. A Fast String Matching Algorithm[J]. MINI-MICRO SYSTEMS ,2004, 25(3): 410-413.

Google Scholar

[6] Xu Cheng,Sun Wei,Dai Zhenghui. Improved Algorithm of BM for Intrusion Detection[J]. APPLICATION RESEARCH OF COMPUTERS , 2006, 11 : 89-91.

Google Scholar

[7] Jiang Qingmin,Wu Ning,Liu Weihua. A Fast Pattern Matching Algorithm in Intrusion Detection System[J]. JOURNAL OF XI'AN JIAOTONG UNIVERSITY , 2009, 43(2): 58-62.

Google Scholar