DocumentCode :
2989860
Title :
Performance Analysis of the Single Pattern Matching Algorithm Based on Prefix Searching
Author :
Xi-hong, Wu
Author_Institution :
Sch. of Comput. Sci., Jiaying Univ., Meizhou, China
fYear :
2011
fDate :
3-4 Dec. 2011
Firstpage :
1024
Lastpage :
1027
Abstract :
Intrusion Detection System has become the important part of the computer and network security because it can effectively compensate for the lack of network security measures. However, the intrusion detection technology relies heavily on pattern matching algorithms, as the choice of pattern matching algorithms directly affect the detection rate, so it is more important. First the paper is detailed analysis the characteristics of the four kinds of single pattern matching which based on prefix search, and then it tests by the number of different pattern strings. The experimental results show that the KMP algorithm can improve effectively the speed of pattern matching. So the application of KMP algorithm can improve the efficiency of intrusion detection.
Keywords :
computer network security; information retrieval; string matching; IDS; KMP algorithm; computer security; intrusion detection system; network security; pattern strings; performance analysis; prefix searching; single pattern matching algorithm; Algorithm design and analysis; Arrays; Classification algorithms; Complexity theory; Intrusion detection; Pattern matching; KMP algorithm; network security; prefix searching; single pattern matching algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location :
Hainan
Print_ISBN :
978-1-4577-2008-6
Type :
conf
DOI :
10.1109/CIS.2011.228
Filename :
6128279
Link To Document :
بازگشت