A memory-efficient and modular approach for large-scale string pattern matching

IEEE Transactions on Computers

Volumn 62, Issue 5, 2013, Pages 844-857

  Le, Hoang ^a   Prasanna, Viktor K ^a  

^a University of Southern California ^*  (United States)

Author keywords

Aho Corasick; ASIC; DFA; field programmable gate array (FPGA); leaf attaching; pipeline; reconfigurable; Rogets; Snort; String matching

Indexed keywords

AHO-CORASICK; DFA; LEAF ATTACHING; RECONFIGURABLE; ROGETS; SNORT; STRING MATCHING;

ALGORITHMS; APPLICATION SPECIFIC INTEGRATED CIRCUITS; BINARY TREES; FIELD PROGRAMMABLE GATE ARRAYS (FPGA); FORESTRY; NETWORK ARCHITECTURE; PATTERN MATCHING; PIPELINES; RECONFIGURABLE HARDWARE;

DYNAMIC RANDOM ACCESS STORAGE;

ALGORITHMS; ELECTRIC CIRCUITS; FORESTRY; HARD WARE; PIPE LINES;

EID: 84875860431     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.2012.38     Document Type: Article

References (19)

1. System Hacking General Password Crackers Wordlists, http:// packetstormsecurity.org/files/31989/roget-dictionary.gz.html, 2012.
2. The Open Source Network Intrusion Detection System, http://www.snort.org, 2012.
3. A.V. Aho and M.J. Corasick, "Efficient String Matching: An Aid to Bibliographic Search," Comm. ACM, vol. 18, no. 6, pp. 333-340, 1975.
4. Z.K. Baker and V.K. Prasanna, "A Methodology for Synthesis of Efficient Intrusion Detection Systems on Fpgas," FCCM '04: Proc. 12th Ann. IEEE Symp. Field-Programmable Custom Computing Machines, pp. 135-144, 2004. (Pubitemid 40661989)
5. A. Basu and G. Narlikar, "Fast Incremental Updates for Pipelined Forwarding Engines," Proc. IEEE INFOCOM '03, pp. 64-74, 2003.
6. CACTI Tool, http://quid.hpl.hp.com:9081/cacti/, 2012.
7. C.R. Clark and D.E. Schimmel, "Scalable Pattern Matching for High Speed Networks," FCCM '04: Proc. 12th Ann. IEEE Symp. Field-Programmable Custom Computing Machines, pp. 249-257, 2004. (Pubitemid 40662000)
8. CompleteBST, http://xlinux.nist.gov/dads/HTML/completeBinaryTree.html, 2012.
9. P. Gupta and N. McKeown, "Algorithms for Packet Classification, " IEEE Network, vol. 15, no. 2, pp. 24-32, Mar/Apr. 2001. (Pubitemid 32330547)
10. N. Hua, H. Song, and T.V. Lakshman, "Variable-Stride Multi-Pattern Matching for Scalable Deep Packet Inspection," Proc. IEEE INFOCOM '09, Apr. 2009.
11. H.-J. Jung, Z. Baker, and V. Prasanna, "Performance of FPGA Implementation of Bit-Split Architecture for Intrusion Detection Systems," Proc. Int'l Parallel and Distributed Processing Symp., p. 177, 2006.
12. H. Le and V. Prasanna, "A Memory-Efficient and Modular Approach for String Matching on FPGAs," Proc. Ann. IEEE Int'l Symp. Field Programmable Custom Computing Machines (FCCM '10), pp. 193-200, May 2010.
13. Prefix Tree, http://en.wikipedia.org/wiki/Trie, 2012.
14. I. Sourdis and D. Pnevmatikatos, "Fast, Large-Scale String Match for a 10 Gbps FPGA-Based Network Intrusion Detection System," Proc. Int'l Conf. Field Programmable Logic and Applications (FPL), vol. 2003, pp. 880-889, 2003.
15. V. Srinivasan and G. Varghese, "Fast Address Lookups Using Controlled Prefix Expansion," ACM Trans. Computer Systems, vol. 17, pp. 1-40, 1999. (Pubitemid 129545750)
16. L. Tan, B. Brotherton, and T. Sherwood, "Bit-Split String-Matching Engines for Intrusion Detection and Prevention," ACM Trans. Architecture and Code Optimization, vol. 3, no. 1, pp. 3-34, 2006.
17. L. Tan and T. Sherwood, "A High Throughput String Matching Architecture for Intrusion Detection and Prevention," ISCA '05: Proc. 32nd Ann. Int'l Symp. Computer Architecture, pp. 112-122, 2005. (Pubitemid 41543435)
18. Y.-H.E. Yang and V.K. Prasanna, "Memory-Efficient Pipelined Architecture for Large-Scale String Matching," Proc. IEEE Symp. Field Programmable Custom Computing Machines (FCCM '09), pp. 104-111, Apr. 2009.
19. F. Yu, R.H. Katz, and T.V. Lakshman, "Gigabit Rate Packet Pattern-Matching Using TCAM," ICNP '04: Proc. 12th IEEE Int'l Conf. Network Protocols, pp. 174-183, 2004. (Pubitemid 40574708)