DocumentCode
1899644
Title
An Effective Pattern Matching Algorithm for Intrusion Detection
Author
Du, Feng
Author_Institution
Zhijiang Coll., Zhejiang Univ. of Technol., Hangzhou, China
Volume
3
fYear
2012
fDate
23-25 March 2012
Firstpage
34
Lastpage
38
Abstract
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.
Keywords
computational complexity; pattern matching; security of data; BMD algorithm; intrusion detection; pattern matching algorithm; pretreatment function; space complexity; time complexity; Algorithm design and analysis; Classification algorithms; Complexity theory; Heuristic algorithms; Intrusion detection; Pattern matching; Runtime; BMD; intrusion detection; pattern matching; security of network; space complexity;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Science and Electronics Engineering (ICCSEE), 2012 International Conference on
Conference_Location
Hangzhou
Print_ISBN
978-1-4673-0689-8
Type
conf
DOI
10.1109/ICCSEE.2012.149
Filename
6188060
Link To Document