A memory-efficient and modular approach for string matching on FPGAs

Proceedings - IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2010

Volumn , Issue , 2010, Pages 193-200

  Le, Hoang ^a   Prasanna, Viktor K ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

ART DESIGN; BINARY SEARCH TREES; FPGA DEVICES; I/O PINS; IN-NETWORK; LOW MEMORY; MEMORY EFFICIENCY; MEMORY EFFICIENT; MODULAR APPROACH; NETWORK TRAFFIC; ON CHIP MEMORY; STRING MATCHING;

COMPUTER CRIME; COMPUTERS; DYNAMIC RANDOM ACCESS STORAGE; INTRUSION DETECTION;

STATIC RANDOM ACCESS STORAGE;

EID: 77954273736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCCM.2010.37     Document Type: Conference Paper

References (17)

1. SAMSUNG SRAMs [Online]. [http://www.samsung.com].
2. The Open Source Anti-Virus Database [Online]. [http://www.clamav.net/].
3. The Open Source Network Intrusion Detection System [Online]. [http://www.snort.org].
4. A. V. Aho and M. J. Corasick. Efficient string matching: an aid to bibliographic search. Commun. ACM, 18(6):333-340, 1975.
5. Z. K. Baker and V. K. Prasanna. A methodology for synthesis of efficient intrusion detection systems on fpgas. In FCCM '04: Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pages 135-144, Washington, DC, USA, 2004. IEEE Computer Society.
6. C. R. Clark and D. E. Schimmel. Scalable pattern matching for high speed networks. In FCCM '04: Proceedings of the 12th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, pages 249-257, Washington, DC, USA, 2004. IEEE Computer Society.
7. J. Dharmapurikar, S. Lockwood. Fast and scalable pattern matching for network intrusion detection systems. IEEE Journal on Selected Areas in Communications, 24(10):1781-1792, 2006.
8. M. French, E. Anderson, and D.-I. Kang. Autonomous system on a chip adaptation through partial runtime reconfiguration. In FCCM '08: Proceedings of the 2008 16th International Symposium on Field-Programmable Custom Computing Machines, pages 77-86, Washington, DC, USA, 2008. IEEE Computer Society.
9. P. Gupta and N. McKeown. Algorithms for packet classification. IEEE Network, 15(2):24-32, 2001.
10. N. Hua, H. Song, and T. V. Lakshman. Variable-stride multi-pattern matching for scalable deep packet inspection. In INFOCOM 2009. The 28th Conference on Computer Communications. IEEE, April 2009.
11. H.-J. Jung, Z. Baker, and V. Prasanna. Performance of fpga implementation of bit-split architecture for intrusion detection systems. Parallel and Distributed Processing Symposium, International, 0:177, 2006.
12. R. Scrofano, M. B. Gokhale, F. Trouw, and V. K. Prasanna. Accelerating molecular dynamics simulations with reconfigurable computers. IEEE Trans. Parallel Distrib. Syst., 19(6):764-778, 2008.
13. I. Sourdis and D. Pnevmatikatos. Fast, large-scale string match for a 10gbps fpga-based network intrusion. FPL, 2003:880-889, 2003.
14. L. Tan, B. Brotherton, and T. Sherwood. Bit-split stringmatching engines for intrusion detection and prevention. ACM Trans. Archit. Code Optim., 3(1):3-34, 2006.
15. L. Tan and T. Sherwood. A high throughput string matching architecture for intrusion detection and prevention. In ISCA '05: Proceedings of the 32nd annual international symposium on Computer Architecture, pages 112-122, Washington, DC, USA, 2005. IEEE Computer Society.
16. Y.-H. E. Yang and V. K. Prasanna. Memory-efficient pipelined architecture for large-scale string matching. In FCCM '09: Proceedings of the 17th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, Washington, DC, USA, 2009. IEEE Computer Society.
17. F. Yu, R. H. Katz, and T. V. Lakshman. Gigabit rate packet pattern-matching using tcam. In ICNP '04: Proceedings of the 12th IEEE International Conference on Network Protocols, pages 174-183, Washington, DC, USA, 2004. IEEE Computer Society.