-
1
-
-
84898648124
-
-
SNORT network intrusion detection system. Accessed: 2013-04-24
-
SNORT network intrusion detection system. http://www.snort.org/. Accessed: 2013-04-24.
-
-
-
-
2
-
-
63749127933
-
SystemT: A system for declarative information extraction
-
Rajasekar Krishnamurthy, Yunyao Li, Sriram Raghavan, Frederick Reiss, Shivakumar Vaithyanathan, and Huaiyu Zhu. SystemT: a system for declarative information extraction. SIGMOD Record, 37(4):7-13, 2008.
-
(2008)
SIGMOD Record
, vol.37
, Issue.4
, pp. 7-13
-
-
Krishnamurthy, R.1
Li, Y.2
Raghavan, S.3
Reiss, F.4
Vaithyanathan, S.5
Zhu, H.6
-
3
-
-
0003620778
-
-
Addison Wesley
-
John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, 2000.
-
(2000)
Introduction to Automata Theory, Languages, and Computation
-
-
Hopcroft, J.E.1
Motwani, R.2
Ullman, J.D.3
-
4
-
-
34547662263
-
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
-
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
-
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
-
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
-
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
-
9
-
-
43449132689
-
Regular expression matching in reconfigurable hardware
-
Ioannis Sourdis, Joao Bispo, Joao M. Cardoso, and Stamatis Vassiliadis. Regular expression matching in reconfigurable hardware. J. Signal Process. Syst., 51(1):99-121, 2008.
-
(2008)
J. Signal Process. Syst
, vol.51
, Issue.1
, pp. 99-121
-
-
Sourdis, I.1
Bispo, J.2
Cardoso, J.M.3
Vassiliadis, S.4
-
10
-
-
70350643877
-
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
-
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
-
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
-
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
-
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
-
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
-
16
-
-
34250161819
-
Sorter based permutation units for media-enhanced microprocessors
-
G. Dimitrakopoulos, Christos Mavrokefalidis, K. Galanopoulos, and D. Nikolos. Sorter based permutation units for media-enhanced microprocessors. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 15(6):711-715, 2007.
-
(2007)
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
, vol.15
, Issue.6
, pp. 711-715
-
-
Dimitrakopoulos, G.1
Mavrokefalidis, C.2
Galanopoulos, K.3
Nikolos, D.4
-
17
-
-
84861596581
-
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
-
-
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)
-
-
|