Fast and Scalable Pattern Matching for Network Intrusion Detection Systems

2006 ◽  
Vol 24 (10) ◽  
pp. 1781-1792 ◽  
Author(s):  
S. Dharmapurikar ◽  
J.W. Lockwood
Author(s):  
Manohar Naik S ◽  
Geethanjali N

Security has become a critical issue in today’s highly distributed and networked systems. Network intrusion detection systems (NIDSs), especially signature-based NIDSs, are being widely deployed in a distributed network environment with the purpose of defending against a variety of network attacks. Most of the commercially available NIDSs are software based and rely on pattern matching to extract the threat from network traffic. The increase in network speed and traffic may make existing algorithms to become a performance bottleneck. Therefore it is very necessary to develop faster and more efficient pattern matching algorithm in order to overcome the troubles on performance of NIDSs. Therefore, we propose a multi fusion pattern matching algorithm for Network Intrusion Detection Systems. The results obtained in percentages from the proposed fusion algorithm given better values in terms processing time in milliseconds than the existing algorithms when data English text are applied to evaluate the fusion performances.


Sign in / Sign up

Export Citation Format

Share Document