Name
Abstract | ||
|---|---|---|
String matching is the most critical operation in network intrusion detection systems (NIDS) [1]. This paper proposes a novel memory-efficient string matching algorithm that only requires around 2% of the memory utilized in Aho-Corasick algorithm [2] but has more than 4 times the throughput of state-of-the-art algorithm with very limited memory resource. The proposed algorithm is flexible to fit different resource constraints and performance requirements. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/LCOMM.2008.080253 | IEEE Communications Letters |
Keywords | Field | DocType |
network intrusion detection systems,string matching,computer network security,resource-restricted network system,embedded system security,software-based string matching algorithm,security of data,aho corasick,throughput,finite element methods,automata,intrusion detection,data structures,algorithm design and analysis | String searching algorithm,Algorithm design,Commentz-Walter algorithm,Computer science,FSA-Red Algorithm,Real-time computing,Rabin–Karp algorithm,Approximate string matching,String metric,Intrusion detection system | Journal |
Volume | Issue | ISSN |
12 | 8 | 1089-7798 |
Citations | PageRank | References |
1 | 0.35 | 5 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yen-Ming Chu | 1 | 70 | 8.06 |
| Nen-Fu Huang | 2 | 620 | 72.93 |
| Chi-Hung Tsai | 3 | 116 | 8.70 |
| Chen-Ying Hsieh | 4 | 4 | 1.15 |