메뉴 건너뛰기




Volumn , Issue , 2009, Pages 104-111

Memory-efficient pipelined architecture for large-scale string matching

Author keywords

[No Author keywords available]

Indexed keywords

BIT-WIDTH; CLOCK FREQUENCY; FIELD PATTERNS; HIGH-THROUGHPUT; NOVEL ARCHITECTURE; ON CHIP MEMORY; PARTIAL STATE; PIPELINED ARCHITECTURE; PROPOSED ARCHITECTURES; STRING MATCHING; SUB-PROBLEMS;

EID: 74349108825     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCCM.2009.17     Document Type: Conference Paper
Times cited : (14)

References (14)
  • 2
    • 74349117070 scopus 로고    scopus 로고
    • SNORT
    • SNORT. http://www.snort.org/.
  • 3
    • 0016518897 scopus 로고
    • Efficient string matching: An aid to bibliographic search
    • Alfred V. Aho and Margaret J. Corasick. Efficient string matching: An aid to bibliographic search. Communications of the ACM, 18(6):333-340, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.6 , pp. 333-340
    • Aho, A.V.1    Corasick, M.J.2
  • 9
    • 51049123027 scopus 로고    scopus 로고
    • Daniele Paolo Scarpazza, Oreste Villa, and Fabrizio Petrini. High-Speed String Searching against Large Dictionaries on the Cell/B.E. Processor. In Proc. of IEEE Int. Parallel & Distributed Proc. Sym. (IPDPS), 2008.
    • Daniele Paolo Scarpazza, Oreste Villa, and Fabrizio Petrini. High-Speed String Searching against Large Dictionaries on the Cell/B.E. Processor. In Proc. of IEEE Int. Parallel & Distributed Proc. Sym. (IPDPS), 2008.
  • 10
    • 33845525241 scopus 로고    scopus 로고
    • Ioannis Sourdis and Dionisios Pnevmatikatos. Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System. Lector Notes in Computer Science, 2778:880-889, 2003.
    • Ioannis Sourdis and Dionisios Pnevmatikatos. Fast, Large-Scale String Match for a 10Gbps FPGA-Based Network Intrusion Detection System. Lector Notes in Computer Science, 2778:880-889, 2003.
  • 11
    • 84991477170 scopus 로고    scopus 로고
    • Lin Tan, Brett Brotherton, and Timothy Sherwood. Bit-Split String-Matching Engines for Intrusion Detection and Prevention. ACM Trans. on Architecture and Code Optimization, 3(1):3-34, 2006.
    • Lin Tan, Brett Brotherton, and Timothy Sherwood. Bit-Split String-Matching Engines for Intrusion Detection and Prevention. ACM Trans. on Architecture and Code Optimization, 3(1):3-34, 2006.
  • 12
    • 27544490145 scopus 로고    scopus 로고
    • A high throughput string matching architecture for intrusion detection and prevention
    • Lin Tan and Timothy Sherwood. A high throughput string matching architecture for intrusion detection and prevention. In Proc. of International Symposium on Computer Architecture, pages 112-122, 2005.
    • (2005) Proc. of International Symposium on Computer Architecture , pp. 112-122
    • Tan, L.1    Sherwood, T.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.