High Speed Pattern Matching for Network IDS/IPS
Source: Iowa State University
The phenomenal growth of the Internet in the last decade and society's increasing dependence on it has brought along with it, a flood of security attacks on the networking and computing infrastructure. Intrusion detection and prevention systems provide security defenses against these attacks by monitoring the headers and payload of the packets flowing through the network. Multiple string matching that can compare hundreds of string patterns simultaneously is a critical component of these systems, and is a well-studied problem. Most of the string matching solutions today are based on the classic Aho-Corasick algorithm, which has an inherent limitation; they can process only one input character in one cycle.