메뉴 건너뛰기




Volumn , Issue , 2013, Pages

Hardware-accelerated regular expression matching for high-throughput text analytics

Author keywords

[No Author keywords available]

Indexed keywords

FIELD PROGRAMMABLE GATE ARRAYS (FPGA); NETWORK ARCHITECTURE; PROGRAM COMPILERS; RECONFIGURABLE ARCHITECTURES;

EID: 84898605818     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FPL.2013.6645534     Document Type: Conference Paper
Times cited : (22)

References (20)
  • 1
    • 84898648124 scopus 로고    scopus 로고
    • SNORT network intrusion detection system. Accessed: 2013-04-24
    • SNORT network intrusion detection system. http://www.snort.org/. Accessed: 2013-04-24.
  • 4
    • 34547662263 scopus 로고    scopus 로고
    • Fast andmemory-efficient regular expression matching for deep packet inspection
    • ACM
    • Fang Yu, Zhifeng Chen, Yanlei Diao, T. V. Lakshman, and Randy H. Katz. Fast andmemory-efficient regular expression matching for deep packet inspection. In Proc. ANCS, pages 93-102. ACM, 2006.
    • (2006) Proc. ANCS , pp. 93-102
    • Yu, F.1    Chen, Z.2    Diao, Y.3    Lakshman, T.V.4    Katz, R.H.5
  • 5
    • 33750368839 scopus 로고    scopus 로고
    • Algorithms to accelerate multiple regular expressions matching for deep packet inspection
    • Sailesh Kumar, Sarang Dharmapurikar, Fang Yu, Patrick Crowley, and Jonathan Turner. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In Proc. SIGCOMM, pages 339-350, 2006.
    • (2006) Proc. SIGCOMM , pp. 339-350
    • Kumar, S.1    Dharmapurikar, S.2    Yu, F.3    Crowley, P.4    Turner, J.5
  • 6
    • 65249094689 scopus 로고    scopus 로고
    • Deflating the big bang: Fast and scalable deep packet inspection with extended finite automata
    • ACM
    • Randy Smith, Cristian Estan, Somesh Jha, and Shijin Kong. Deflating the big bang: fast and scalable deep packet inspection with extended finite automata. In Proc. SIGCOMM '08, pages 207-218. ACM, 2008.
    • (2008) Proc. SIGCOMM '08 , pp. 207-218
    • Smith, R.1    Estan, C.2    Jha, S.3    Kong, S.4
  • 7
    • 84876514773 scopus 로고    scopus 로고
    • Designing a programmable wirespeed regular-expression matching accelerator
    • Dec
    • Jan van Lunteren, Christoph Hagleitner, Timothy Heil, Giora Biran, Uzi Shvadron, and Kubilay Atasu. Designing a programmable wirespeed regular-expression matching accelerator. In Proc. MICRO, pages 461-472, Dec. 2012.
    • (2012) Proc. MICRO , pp. 461-472
    • Van Lunteren, J.1    Hagleitner, C.2    Heil, T.3    Biran, G.4    Shvadron, U.5    Atasu, K.6
  • 8
    • 84963983866 scopus 로고    scopus 로고
    • Fast regular expression matching using FPGAs
    • Reetinder Sidhu and Viktor K. Prasanna. Fast regular expression matching using FPGAs. In Proc. FCCM '01, pages 227-238, 2001.
    • (2001) Proc. FCCM '01 , pp. 227-238
    • Sidhu, R.1    Prasanna, V.K.2
  • 10
    • 70350643877 scopus 로고    scopus 로고
    • Compact architecture for high-throughput regular expression matching on FPGA
    • Yi-Hua E. Yang,Weirong Jiang, and Viktor K. Prasanna.compact architecture for high-throughput regular expression matching on FPGA. In Proc. ANCS, pages 30-39, 2008.
    • (2008) Proc. ANCS , pp. 30-39
    • Yang, Y.-H.E.1    Jiang, W.2    Prasanna, V.K.3
  • 11
    • 77954020980 scopus 로고    scopus 로고
    • Compiling pcre to fpga for accelerating snort ids
    • ACM
    • Abhishek Mitra, Walid Najjar, and Laxmi Bhuyan.compiling PCRE to FPGA for accelerating SNORT IDS. In Proc. ANCS, pages 127- 136. ACM, 2007.
    • (2007) Proc. ANCS , pp. 127-136
    • Mitra, A.1    Najjar, W.2    Bhuyan, L.3
  • 12
    • 56749186238 scopus 로고    scopus 로고
    • A hybrid finite automaton for practical deep packet inspection
    • Michela Becchi and Patrick Crowley. A hybrid finite automaton for practical deep packet inspection. In Proc. CoNEXT, 2007.
    • (2007) Proc. CoNEXT
    • Becchi, M.1    Crowley, P.2
  • 13
    • 79960879060 scopus 로고    scopus 로고
    • Space-time tradeoff in regular expression matching with semi-deterministic finite automata
    • Yi-Hua E. Yang and Viktor K. Prasanna. Space-time tradeoff in regular expression matching with semi-deterministic finite automata. In Proc. INFOCOM, pages 1853-1861, 2011.
    • (2011) Proc. INFOCOM , pp. 1853-1861
    • Yang, Y.-H.E.1    Prasanna, V.K.2
  • 14
    • 79953217392 scopus 로고    scopus 로고
    • A regular expression matching circuit based on a decomposed automaton
    • Hiroki Nakahara, Tsutomu Sasao, andMunehiroMatsuura. A regular expression matching circuit based on a decomposed automaton. In Proc. ARC, pages 16-28, 2011.
    • (2011) Proc. ARC , pp. 16-28
    • Nakahara, H.1    Sasao, T.2    Matsuura, M.3
  • 15
    • 34547443955 scopus 로고    scopus 로고
    • Fast bit compression and expansion with parallel extract and parallel deposit instructions
    • Yedidya Hilewitz and Ruby B. Lee. Fast bit compression and expansion with parallel extract and parallel deposit instructions. In Proc. ASAP, pages 65-72, 2006.
    • (2006) Proc. ASAP , pp. 65-72
    • Hilewitz, Y.1    Lee, R.B.2
  • 17
    • 84861596581 scopus 로고    scopus 로고
    • Hardware-accelerated regular expression matching at multiple tens of Gb/s
    • Jan van Lunteren and Alexis Guanella. Hardware-accelerated regular expression matching at multiple tens of Gb/s. In Proc. INFOCOM, pages 1737-1745, 2012.
    • (2012) Proc. INFOCOM , pp. 1737-1745
    • Van Lunteren, J.1    Guanella, A.2
  • 18
    • 84898665120 scopus 로고    scopus 로고
    • Application layer packet classifier for Linux. Accessed: -11-23
    • Application layer packet classifier for Linux. http://l7- filter.sourceforge.net/. Accessed: 2008-11-23.
    • (2008)


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