Fast Regular Expression Matching Using Small TCAM

被引:29
作者
Meiners, Chad R. [1 ]
Patel, Jignesh [2 ]
Norige, Eric [2 ]
Liu, Alex X. [2 ,3 ]
Torng, Eric [2 ]
机构
[1] Michigan State Univ, E Lansing, MI 48824 USA
[2] Michigan State Univ, Dept Comp Sci & Engn, E Lansing, MI 48824 USA
[3] Nanjing Univ, Dept Comp Sci & Technol, Nanjing 210093, Jiangsu, Peoples R China
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
Deep packet inspection; information security; intrusion detection; regular expression matching; security; ternary content addressable memory (TCAM); DEEP PACKET INSPECTION; ALGORITHM;
D O I
10.1109/TNET.2013.2256466
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Regular expression (RE) matching is a core component of deep packet inspection in modern networking and security devices. In this paper, we propose the first hardware-based RE matching approach that uses ternary content addressable memory (TCAM), which is available as off-the-shelf chips and has been widely deployed in modern networking devices for tasks such as packet classification. We propose three novel techniques to reduce TCAM space and improve RE matching speed: transition sharing, table consolidation, and variable striding. We tested our techniques on eight real-world RE sets, and our results show that small TCAMs can be used to store large deterministic finite automata (DFAs) and achieve potentially high RE matching throughput. For space, we can store each of the corresponding eight DFAs with 25 000 states in a 0.59-Mb TCAM chip. Using a different TCAM encoding scheme that facilitates processing multiple characters per transition, we can achieve potential RE matching throughput of 10-19 Gb/s for each of the eight DFAs using only a single 2.36-Mb TCAM chip.
引用
收藏
页码:94 / 109
页数:16
相关论文
共 28 条
[1]  
Agrawal B, 2006, INT SYM PERFORM ANAL, P120
[2]   EFFICIENT STRING MATCHING - AID TO BIBLIOGRAPHIC SEARCH [J].
AHO, AV ;
CORASICK, MJ .
COMMUNICATIONS OF THE ACM, 1975, 18 (06) :333-340
[3]  
Alicherry M, 2006, PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, P183
[4]  
[Anonymous], 2007, P 3 ACM IEEE S ARCH, DOI DOI 10.1145/1323548.1323573
[5]  
[Anonymous], P CONEXT
[6]  
Becchi M., 2008, P CONEXT
[7]  
Becchi M., 2008, INT C ARCHITECTURES, P50, DOI DOI 10.1145/1477942.1477950
[8]  
Becchi M., 2008, P IEEE IISWC, P78
[9]   Memory-efficient regular expression search using state merging [J].
Becchi, Michela ;
Cadambi, Srihari .
INFOCOM 2007, VOLS 1-5, 2007, :1064-+
[10]  
Bremler-Barr A., 2010, P 29 C INFORM COMMUN, P659