Name
Abstract | ||
|---|---|---|
As the variety of hazardous packet payload contents increases, the intrusion detection system (IDS) should be 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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/LCOMM.2009.12.082230 | IEEE Communications Letters |
Keywords | Field | DocType |
Intrusion detection,Pattern matching,Payloads,Automata,Real time systems,Reflective binary codes,Condition monitoring,Scalability | String searching algorithm,Commentz-Walter algorithm,Computer science,Binary code,Algorithm,Approximate string matching,String metric,String (computer science),Intrusion detection system,Boyer–Moore string search algorithm | Journal |
Volume | Issue | ISSN |
13 | 12 | 1089-7798 |
Citations | PageRank | References |
8 | 0.80 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hyunjin Kim | 1 | 42 | 4.84 |
| Hyejeong Hong | 2 | 32 | 5.16 |
| hongslk kim | 3 | 10 | 1.21 |
| Sungho Kang | 4 | 436 | 78.44 |