By Topic

Performance Analysis of the Single Pattern Matching Algorithm Based on Prefix Searching

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

1 Author(s)
Wu Xi-hong ; Sch. of Comput. Sci., Jiaying Univ., Meizhou, China

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.

Published in:

Computational Intelligence and Security (CIS), 2011 Seventh International Conference on

Date of Conference:

3-4 Dec. 2011