High performance string matching algorithm for a Network Intrusion Prevention System (NIPS)

2006 Workshop on High Performance Switching and Routing, HPSR 2006

Volumn , Issue , 2006, Pages 147-154

  Weinsberg, Yaron ^a   Tzur David, Shimrit ^a   Dolev, Danny ^a   Anker, Tal ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b Radian A Marvell Company

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER WORMS; PATTERN MATCHING; TELECOMMUNICATION TRAFFIC;

INTRUSION DETECTION SYSTEMS (IDS); NETWORK INTRUSION PREVENTION SYSTEMS (NIPS);

INTRUSION DETECTION;

EID: 41549085235     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/hpsr.2006.1709697     Document Type: Conference Paper

References (18)

1. VanDyke Software. Homepage at http://www.vandyke.com/, keywords = vandyke.source = http://www.vandyke.com/.
2. Hardware NIPS Project Home Page. Homepage at http://www.cs.huji.ac.il/ labs/danss/nips.
3. Snort.http://www.snort.org/.
4. Charles E. Leiserson Thomas H. Cormen and Ronald L. Rivest. Introduction to Algorithms. The MIT Press, 1990.
5. B. W. Watson. G. Zwaan. and Mrs F. Van Neerven. A taxonomy of keyword pattern matching algorithms. Technical report, January 28 1992.
6. Donald E. Knuth, J.H. Morris, and Vaughan R. Pratt. Fast pattern matching in strings. SIAM Journal of Computing, 6(2):323-350, 1977.
7. David R. Musser and Gor V. Nishanov. A fast generic sequence matching algorithm, May 13 2004.
8. Robert S. Boyer and J. Strother Moore. A fast string searching algorithm. Communications of the ACM, 20(10):62-72, 1977.
9. Artur Czumaj. Leszek Gasieniec. Stefan Jarominek, Thierry Lecroq. Wojciech Plandowski. and Wbjciech Rytter. Fast practical multi-pattern matching. October 11 1993.
10. A. Czumaj. L. Gasieniec. M. Crochemore, S. Jarominek, T. Lecroq. and W. Plandowski. Fast practical multi-pattern matching, September 02 1999.
11. Alfred V. Alio and Margaret J. Corasick. Efficient string matching: an aid to bibliographic search. Communications of the ACM. 18(6):333-340, 1975.
12. Yu Fang, Randy H. Katz, and T. V. Lakshman. Gigabit rate packet pattern-mate hing using team. In ICNP. pages 174-183, 2004.
13. S. Dharmapurikar. P. Krishnamurthy, T. Sproull, and J. Lockwood. Deep packet inspection using parallel bloom filters, 2003.
14. David E. Taylor, Praveen Krishnamurthy, and Sarang Dharmapurikar, Longest prefix matching using bloom filters, September 03 2000.
15. Rong-Tai Liu, Nen-Fu Huang, Chih-Hao Chen, and Chia-Nan Kao. A fast string-matching algorithm for network processor-based intrusion detection system. Trans. on Embedded Computing Sys., 3(3):614-633, 2004.
16. Trevis Chandler Igor Arsovski and Ali Sheikholeslami. A ternary content-addressable memory (team) based on 4t static storage and including a current-race sensing scheme. IEEE Journal of Solid-State Circuits. 38(1), January.
17. Clamav.http://www.clamav.net/.
18. Mit darpa project data set.http://www.ll.mit.edu/IST/ideval/index.html.