.png){kind=icon}
.png){kind=icon}
Return
A Memory-Efficient Parallel String Matching for Intrusion Detection Systems
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2009.12.082230.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
As the variety of hazardous packet payload contents increases, the intrusion detection system (IDS) should he able to detect numerous patterns in real time. For this reason, this paper proposes an Aho-Corasick algorithm based parallel string matching. In order to balance memory usage between homogeneous finite-state machine (FSM) tiles for each string matcher, an optimal set of bit position groups is determined. Target patterns are sorted by binary-reflected gray code (BRGC), which reduces bit transitions in patterns mapped onto a string matcher. In the evaluations of Snort rules, the proposed string matching outperforms the existing bit-split string matching.
Keywords:
Computer network security
finite state machines
site security monitoring
string matching