Also Available Domains Xilinx Vivado|Xilinx ISE
In this project, multiple string pattern matching by parallel computation is implemented. Multi-string pattern matching is a crucial building block for many network security applications, and thus of great importance. Since every byte of a packet has to be inspected by a large set of patterns, it often becomes a bottleneck of these applications and dominates the performance of an entire system. Many existing works have been devoted to alleviate this performance bottleneck either by algorithm optimization or hardware acceleration. However, neither one provides the desired scalability and costs that keep pace with the drastic increase of the network bandwidth and network traffic today. In this paper, we present a scalable and cost-efficient multi-string pattern matching system leveraging the capability of emerging programmable switches. It combines the following two techniques, a smart state encoding scheme to fit a large number of strings into the limited memory on the programmable switch, and a variable k-stride transition mechanism to increase the throughput significantly with the same level of memory costs. The proposed method provide orders of magnitude improvement in throughput which is scalable with pattern sets and workloads, and could also significantly decrease the number of entries and memory requirement.
Keywords:- Multi-string pattern matching, NIDS, Deterministic Finite Automaton, Aho-Corasick (AC) algorithm
NOTE: Without the concern of our team, please don't submit to the college. This Abstract varies based on student requirements.

Software Requirements:
Hardware Requirements: