Name
Title | ||
|---|---|---|
A Non-Computational Intensive Pre-Filter For Pattern Matching In Network Intrusion Detection Systems |
Abstract | ||
|---|---|---|
Pattern or string matching algorithm is one of the most critical tasks in the design of a high-speed network intrusion detection system (NIDS). In this paper, an efficient pre-filtering algorithm, called Super-Symbol Filter (SSF), is proposed to filter the normal traffic before they are forwarded to a pattern matching algorithm. The proposed SSF algorithm uses a tiny data structure, and is light-computational and cache-resident. It can be implemented efficiently in a software-based platform. Experimental results show that with Snort's patterns, the computation time of the SSF with the AC algorithm to process the Defcon9 trace is only one-third to half of that of a pure AC algorithm. Thus, the speed gain of the proposed scheme is around 100-300%. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1109/GLOCOM.2006.294 | GLOBECOM 2006 - 2006 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE |
Keywords | DocType | ISSN |
Search Filter, Intrusion Detection, Network Security, String Matching | Conference | 1930-529X |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
7 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nen-Fu Huang | 1 | 620 | 72.93 |
| Yen-Ming Chu | 2 | 70 | 8.06 |
| Yih-Jou Tzang | 3 | 50 | 5.33 |
| Jianlin Chen | 4 | 0 | 1.35 |
| Hsien-wei Hun | 5 | 3 | 1.30 |
| Ming-Chang Shih | 6 | 1 | 2.05 |
| Chia-Nan Kao | 7 | 74 | 8.20 |