Name
Abstract | ||
|---|---|---|
In today's Internet, worms and viruses cause service disruptions with enormous economic impact. Current attack prevention mechanisms rely on end-user cooperation to install new system patches or upgrade security software, yielding slow reaction time. However, malicious attacks spread much faster than users can respond, making effective attack prevention difficult. Network-based mechanisms, by avoiding end-user coordination, can respond rapidly to new attacks. Such mechanisms require the network to inspect the packet payload at line rates to detect and filter those packets containing worm signatures. These signature sets are large (e.g., thousands) and complex. Software-only implementations are unlikely to meet the performance goals. Therefore, making a network-based scheme practical requires efficient algorithms suitable for hardware implementations. This paper develops a Ternary Content Addressable Memory (TCAM) based multiple-pattern matching scheme. The scheme can handle complex patterns, such as arbitrarily long patterns, correlated patterns, and patterns with negation. For the ClamAv virus database with 1768 patterns whose sizes vary from 6 bytes to 2189 bytes, the proposed scheme can operate at a 2 Gbps rate with a 240KB TCAM. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1109/ICNP.2004.1348108 | ICNP |
Keywords | Field | DocType |
economic impact,pattern matching,computer viruses,internet,reaction time | Gigabit,Byte,Content-addressable memory,Computer science,Network packet,Computer virus,Computer network,Pattern matching,Payload,Distributed computing,The Internet | Conference |
ISBN | Citations | PageRank |
0-7695-2161-4 | 165 | 7.66 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Fang Yu | 1 | 818 | 39.11 |
| Randy H. Katz | 2 | 16819 | 3018.89 |
| T. V. Lakshman | 3 | 4189 | 405.35 |