A Comparison of Single Keyword Pattern Matching Algorithms

With the growth of internet based application and services it mandatory to secure those applications. Firewall is not significantly able to secure outside the network. Thus network intrusion detection systems are used to protect them. Pattern matching is used in intrusion detection systems (NIDSs). In this paper an overview and comparison is presented of various single keyword pattern matching algorithms. We explain and compare the basic differences and run time complexity of each algorithm. Thus we can say that there is no perfect algorithm that can solves all the pattern matching problem. We present different solutions according to different scenarios.