메뉴 건너뛰기




Volumn , Issue , 2009, Pages 40-49

LaFA: Lookahead finite automata for scalable regular expression detection

Author keywords

deep packet inspection; finite automation; FPGA; LaFA; network intrusion detection system; regular expressions

Indexed keywords

DEEP PACKET INSPECTION; FINITE AUTOMATION; FPGA; LAFA; NETWORK INTRUSION DETECTION SYSTEMS; REGULAR EXPRESSIONS;

EID: 77954055303     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1882486.1882496     Document Type: Conference Paper
Times cited : (7)

References (27)
  • 4
    • 33847200789 scopus 로고    scopus 로고
    • Multiple Sequence Alignment Containing a Sequence of Regular Expressions
    • A. N. Arslan. Multiple Sequence Alignment Containing a Sequence of Regular Expressions. In CIBCB, pages 1-7, 2005.
    • (2005) CIBCB , pp. 1-7
    • Arslan, A.N.1
  • 5
    • 51249094491 scopus 로고    scopus 로고
    • Boundary hash for memory-efficient deep packet inspection
    • N. S. Artan, M. Bando, and H. J. Chao. Boundary hash for memory-efficient deep packet inspection. In ICC, pages 1732-1737, 2008.
    • (2008) ICC , pp. 1732-1737
    • Artan, N.S.1    Bando, M.2    Chao, H.J.3
  • 6
    • 34548300090 scopus 로고    scopus 로고
    • TriBiCa: Trie bitmap content analyzer for high-speed network intrusion detection
    • N. S. Artan and H. J. Chao. TriBiCa: Trie bitmap content analyzer for high-speed network intrusion detection. In INFOCOM, pages 125-133, 2007.
    • (2007) INFOCOM , pp. 125-133
    • Artan, N.S.1    Chao, H.J.2
  • 7
    • 77954076605 scopus 로고    scopus 로고
    • Regular expression software deceleration for intrusion detection systems
    • Z. K. Baker, H.-J. Jung, and V. K. Prasanna. Regular expression software deceleration for intrusion detection systems. In FPL, pages 1-8, 2006.
    • (2006) FPL , pp. 1-8
    • Baker, Z.K.1    Jung, H.-J.2    Prasanna, V.K.3
  • 8
    • 67249156662 scopus 로고    scopus 로고
    • Highly memory-efficient LogLog Hash for deep packet inspection
    • M. Bando, N. S. Artan, and H. J. Chao. Highly memory-efficient LogLog Hash for deep packet inspection. In GLOBECOM, pages 1-6, 2008.
    • (2008) GLOBECOM , pp. 1-6
    • Bando, M.1    Artan, N.S.2    Chao, H.J.3
  • 9
    • 34548322723 scopus 로고    scopus 로고
    • Memory-efficient regular expression search using state merging
    • M. Becchi and S. Cadambi. Memory-efficient regular expression search using state merging. In INFOCOM, pages 1064-1072, 2007.
    • (2007) INFOCOM , pp. 1064-1072
    • Becchi, M.1    Cadambi, S.2
  • 10
    • 56749186238 scopus 로고    scopus 로고
    • A hybrid finite automaton for practical deep packet inspection
    • M. Becchi and P. Crowley. A hybrid finite automaton for practical deep packet inspection. In CoNEXT, 2007.
    • (2007) CoNEXT
    • Becchi, M.1    Crowley, P.2
  • 11
    • 77954026099 scopus 로고    scopus 로고
    • An improved algorithm to accelerate regular expression evaluation
    • M. Becchi and P. Crowley. An improved algorithm to accelerate regular expression evaluation. In ANCS, pages 145-154, 2007.
    • (2007) ANCS , pp. 145-154
    • Becchi, M.1    Crowley, P.2
  • 12
    • 70350771139 scopus 로고    scopus 로고
    • Extending finite automata to effeciently match perl-compatible regular expressions
    • M. Becchi and P. Crowley. Extending finite automata to effeciently match perl-compatible regular expressions. In CoNEXT, 2008.
    • (2008) CoNEXT
    • Becchi, M.1    Crowley, P.2
  • 13
    • 40549088573 scopus 로고    scopus 로고
    • Deep network packet filter design for reconfigurable devices
    • Y. H. Cho and W. H. Mangione-Smith. Deep network packet filter design for reconfigurable devices. Trans. on Embedded Computing Sys., 7(2):1-26, 2008.
    • (2008) Trans. on Embedded Computing Sys. , vol.7 , Issue.2 , pp. 1-26
    • Cho, Y.H.1    Mangione-Smith, W.H.2
  • 14
    • 34547577318 scopus 로고    scopus 로고
    • RE-MuSiC: A tool for multiple sequence alignment with regular expression constraints
    • Y. S. Chung, W. H. Lee, C. Y. Tang, and C. L. Lu. RE-MuSiC: a tool for multiple sequence alignment with regular expression constraints. Nucleic Acids Res. (Web Server issue), (35):W639-644, 2007.
    • (2007) Nucleic Acids Res. (Web Server Issue) , Issue.35
    • Chung, Y.S.1    Lee, W.H.2    Tang, C.Y.3    Lu, C.L.4
  • 17
    • 77954013621 scopus 로고    scopus 로고
    • Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia
    • S. Kumar, B. Chandrasekaran, J. Turner, and G. Varghese. Curing regular expressions matching algorithms from insomnia, amnesia, and acalculia. In ANCS, pages 155-164, 2007.
    • (2007) ANCS , pp. 155-164
    • Kumar, S.1    Chandrasekaran, B.2    Turner, J.3    Varghese, G.4
  • 18
    • 33750368839 scopus 로고    scopus 로고
    • Algorithms to accelerate multiple regular expressions matching for deep packet inspection
    • S. Kumar, S. Dharmapurikar, F. Yu, P. Crowley, and J. Turner. Algorithms to accelerate multiple regular expressions matching for deep packet inspection. In SIGCOMM, pages 339-350, 2006.
    • (2006) SIGCOMM , pp. 339-350
    • Kumar, S.1    Dharmapurikar, S.2    Yu, F.3    Crowley, P.4    Turner, J.5
  • 19
    • 34547683816 scopus 로고    scopus 로고
    • Advanced algorithms for fast and scalable deep packet inspection
    • S. Kumar, J. Turner, and J. Williams. Advanced algorithms for fast and scalable deep packet inspection. In ANCS, pages 81-92, 2006.
    • (2006) ANCS , pp. 81-92
    • Kumar, S.1    Turner, J.2    Williams, J.3
  • 21
    • 50149109450 scopus 로고    scopus 로고
    • ReCPU: A parallel and pipelined architecture for regular expression matching
    • M. Paolieri, I. Bonesana, and M. D. Santambrogio. ReCPU: A parallel and pipelined architecture for regular expression matching. In IFIP, VLSI - SoC., pages 19-24, 2007.
    • (2007) IFIP, VLSI - SoC , pp. 19-24
    • Paolieri, M.1    Bonesana, I.2    Santambrogio, M.D.3
  • 22
    • 50249130270 scopus 로고    scopus 로고
    • XFA: Faster signature matching with extended automata
    • R. Smith, C. Estan, and S. Jha. XFA: Faster signature matching with extended automata. In SP, pages 187-201, 2008.
    • (2008) SP , pp. 187-201
    • Smith, R.1    Estan, C.2    Jha, S.3
  • 23
    • 62849094139 scopus 로고    scopus 로고
    • Deflating the big bang: Fast and scalable deep packet inspection with extended finite automata
    • R. Smith, C. Estan, S. Jha, and S. Kong. Deflating the big bang: Fast and scalable deep packet inspection with extended finite automata. In SIGCOMM, 2008.
    • (2008) SIGCOMM
    • Smith, R.1    Estan, C.2    Jha, S.3    Kong, S.4
  • 24
    • 38349152484 scopus 로고    scopus 로고
    • Scalable multigigabit pattern matching for packet inspection
    • I. Sourdis, D. Pnevmatikatos, and S. Vassiliadis. Scalable multigigabit pattern matching for packet inspection. In VLSI, volume 16, pages 156-166, 2008.
    • (2008) VLSI , vol.16 , pp. 156-166
    • Sourdis, I.1    Pnevmatikatos, D.2    Vassiliadis, S.3
  • 26
    • 34547662263 scopus 로고    scopus 로고
    • Fast and memory-efficient regular expression matching for deep packet inspection
    • F. Yu, Z. Chen, Y. Diao, T. V. Lakshman, and R. H. Katz. Fast and memory-efficient regular expression matching for deep packet inspection. In ANCS, pages 93-102, 2006.
    • (2006) ANCS , pp. 93-102
    • Yu, F.1    Chen, Z.2    Diao, Y.3    Lakshman, T.V.4    Katz, R.H.5
  • 27
    • 17744398417 scopus 로고    scopus 로고
    • Gigabit rate packet pattern-matching using TCAM
    • F. Yu, R. Katz, and T. Lakshman. Gigabit rate packet pattern-matching using TCAM. In ICNP, pages 174-183, 2004.
    • (2004) ICNP , pp. 174-183
    • Yu, F.1    Katz, R.2    Lakshman, T.3


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