Hardware Architecture for the Fast Pattern Matching

被引:0
作者
Kastil, Jan [1 ]
Kosar, Vlastimil [1 ]
Korenek, Jan [1 ]
机构
[1] Brno Univ Technol, Fac Informat Technol, CS-61090 Brno, Czech Republic
来源
PROCEEDINGS OF THE 2013 IEEE 16TH INTERNATIONAL SYMPOSIUM ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS & SYSTEMS (DDECS) | 2013年
关键词
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
As the speed of current computer networks increases, it is necessary to protect networks by security systems such as firewalls and Intrusion Detection Systems (IDS) operating at multigigabit speeds. As attacks on modern networks became more and more complex, it is necessity to detect attack placed not only in single packet but at the level of network flows. Pattern matching in the network flows is the time-critical operation of many modern IDS. Most of the regularly used patterns are described by the regular expression. This work describes advanced hardware architecture for the fast regular expression matching based on the perfect hashing. The proposed architecture is scalable and can achieve multigigabit throughput per network flow.
引用
收藏
页码:120 / 123
页数:4
相关论文
共 15 条
[1]  
Becchi M., 2008, INT C ARCHITECTURES, P50, DOI DOI 10.1145/1477942.1477950
[2]  
Botelho FC, 2007, LECT NOTES COMPUT SC, V4619, P139
[3]   Membership in constant time and almost-minimum space [J].
Brodnik, A ;
Munro, JI .
SIAM JOURNAL ON COMPUTING, 1999, 28 (05) :1627-1640
[4]  
Clark CR, 2004, ANN IEEE SYM FIELD P, P249, DOI 10.1109/fccm.2004.50
[5]   Perfect hashing [J].
Czech, ZJ ;
Havas, G ;
Majewski, BS .
THEORETICAL COMPUTER SCIENCE, 1997, 182 (1-2) :1-143
[6]  
Fang Yu, 2006, ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS 2006), P93, DOI 10.1109/ANCS.2006.4579527
[7]   An Improved DFA for Fast Regular Expression Matching [J].
Ficara, Domenico ;
Giordano, Stefano ;
Procissi, Gregorio ;
Vitucci, Fabio ;
Antichi, Gianni ;
Di Pietro, Andrea .
ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2008, 38 (05) :31-40
[8]  
Kastil J, 2010, IEEE INT SYMP DESIGN, P149, DOI 10.1109/DDECS.2010.5491796
[9]   Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing [J].
Kastil, Jan ;
Korenek, Jan ;
Lengal, Ondrej .
PROCEEDINGS OF THE 2009 12TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN, ARCHITECTURES, METHODS AND TOOLS, 2009, :823-+
[10]  
Kumar S., 2007, P 3 ACM IEEE S ARCH, P155, DOI DOI 10.1145/1323548.1323574