A platform-based SoC design and implementation of scalable automaton matching for deep packet inspection

Journal of Systems Architecture

Volumn 53, Issue 12, 2007, Pages 937-950

  Lin, Ying Dar ^a   Tseng, Kuo Kun ^a   Lee, Tsern Huei ^a   Lin, Yi Neng ^a   Hung, Chen Chou ^a   Lai, Yuan Cheng ^b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Taiwan)

Author keywords

Automaton; Content filtering; Deep packet inspection; String matching

Indexed keywords

COMPUTATIONAL METHODS; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); INTRUSION DETECTION; MICROPROCESSOR CHIPS; PACKET NETWORKS; SPAMMING;

CONTENT FILTERING; DEEP PACKET INSPECTION; STRING MATCHING; WEB FILTERING;

PATTERN MATCHING;

EID: 34548526139     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.sysarc.2007.03.005     Document Type: Article

References (26)

1. S. Antonatos, K. Anagnostakis, E. Markatos, Generating realistic workloads for network intrusion detection systems, in: ACM Workshop on Software and Performance, Redwood Shores, CA, Jan. 2004.
2. Navarro G., and Ranot M. Flexible Pattern Matching in Strings (2002), Cambridge University Press
3. Navarro G. A guided tour to approximate string matching. ACM Computing Surveys 33 1 (2001) 31-88
4. Wu S., and Manber U. Fast text searching allowing errors. Communication of the ACM 35 (1992) 83-91
5. Boyer R.S., and Moore J.S. A fast string searching algorithm. Communications of the ACM 20 10 (1977) 762-772
6. A.V. Aho, M.J. Corasick, Efficient string matching: an aid to bibliographic search, Communications of the ACM, 1975, pp. 333-340.
7. N. Tuck, T. Sherwood, B. Calder, G. Varghese, Deterministic memory-efficient string matching algorithms for intrusion detection, IEEE Infocom, Hong Kong, China, 2004.
8. C. Coit, S. Staniford, J. Mcalerney, Towards faster string matching for intrusion detection, DARPA Information Survivability Conference and Exhibition 2002, pp. 367-373.
9. N. Desai, Increasing performance in high speed NIDS, .
10. Raffinot M. On the multi backward Dawg matching algorithm (MultiBDM). Workshop on String Processing (1997), Carleton U. Press
11. L. Tan, T. Sherwood, A high throughput string matching architecture for intrusion detection and prevention, ISCA, 2005.
12. M. Aldwairi, T. Conte, P. Franzon, Configurable string matching hardware for speeding up intrusion detection, ACM CAN, 2005.
13. J. Lockwood, An open platform for development of network processing modules in reconfigurable hardware, IEC DesignCon, Santa Clara, CA, Jan. 2001.
14. J. Moscola, J. Lockwood, R.P. Loui, M. Pachos, Implementation of a content-scanning module for an internet firewall, IEEE FCCM, 2003.
15. Z.K. Baker, V.K. Prasanna, Time and area efficient pattern matching on FPGAs, ACM/SIGDA FPGA, CA, USA, Feb 2004.
16. G. Tripp, A finite-state-machine based string matching system for intrusion detection on high-speed network, EICAR, May 2005.
17. Bu L., and Chandy J.A. A keyword match processor architecture using content addressable memory. ACM VLSI April (2004) 26-28
18. R. Sidhu, V. Prasanna, Fast regular expression matching using FPGAs, IEEE FCCM April 2001.
19. R. Franklin, D. Carver, B.L. Hutchings, Assisting network intrusion detection with reconfigurable hardware, IEEE FCCM, Napa, CA, Apr 2002.
20. C.R. Clark, D.E. Schimmel, Scalable pattern matching for high speed networks, IEEE FCCM, 2004.
21. Y.H. Cho, W.H. Mangione, A pattern matching coprocessor for network security, ACM/IEEE DAC, California, USA, June 2005.
22. I. Sourdis, D. Pnevmatikatos, Pre-decoded CAMs for efficient and high-speed NIDS pattern matching, IEEE FCCM, 2004.
23. Gokhale M., Dubois D., Dubois A., Boorman M., Poole S., and Hogsett V. Granidt: towards gigabit rate network intrusion detection technology. LNCS 2438 Jan (2002)
24. Dharmapurikar S., Krishnamurthy P., Sproull T.S., and Lockwood J.W. Deep packet inspection using parallel bloom filters. IEEE Micro. 24 1 (2004)
25. H.M. Blüthgen, T. Noll, R. Aachen, A programmable processor for approximate string matching with high throughput rate, IEEE ASAP, 2000.
26. J.H. Park, K.M. George, Parallel string matching algorithms based on dataflow, HICSS, Hawaii, 1999.