Publication Type:

Journal Article

Source:

International Journal of Applied Engineering Research, Research India Publications, Volume 10, Number 16, p.37563-37568 (2015)

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-84942021518&partnerID=40&md5=dd202694c7a1613cc1824cb918b9d8c0

Abstract:

Network Intrusion Detection Systems (NIDS) have become integral to today’s computer networks as the information transferred through the network is highly vulnerable to cyber-attacks. The implementation of the same involves an efficient string matching algorithm which will compare certain parameters and features of the received packets depending on the protocols used for communication. As the system incorporates a huge number of pattern comparisons, the string matching algorithm stands as the heart of entire NIDS system. Software implementations such as SNORT are inadequate for Ethernet backbones with bit rates of hundreds of Gigabits where high throughputs are required. Small improvements at the algorithmic level can boost the performance of the system drastically. In order to handle the large payloads of current network packets, simple and commonly used algorithms such as Aho-Corasick lack performance. In this work, the Z algorithm which is generally used for finding large subsequences in DNA strands is adapted for string matching for intrusion detection. This new algorithm shows noticeable improvements in performance and scalability. © Research India Publications.

Notes:

cited By 0

Cite this Research Publication

P. Dhanesh and Harish, S., “A fast and scalable pattern matching scheme for NIDS using Z algorithm”, International Journal of Applied Engineering Research, vol. 10, pp. 37563-37568, 2015.