Visible to the public Regular Expression Matching with Memristor TCAMs for Network Security

TitleRegular Expression Matching with Memristor TCAMs for Network Security
Publication TypeConference Paper
Year of Publication2018
AuthorsGraves, Catherine E., Ma, Wen, Sheng, Xia, Buchanan, Brent, Zheng, Le, Lam, Si-Ty, Li, Xuema, Chalamalasetti, Sai Rahul, Kiyama, Lennie, Foltin, Martin, Strachan, John Paul, Hardy, Matthew P.
Conference NameProceedings of the 14th IEEE/ACM International Symposium on Nanoscale Architectures
PublisherACM
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-5815-6
Keywordscomposability, Computational Intelligence, expandability, finite automata, Memristor, Network security, pubcrawl, regular expression matching, Resiliency, TCAM
Abstract

We propose using memristor-based TCAMs (Ternary Content Addressable Memory) to accelerate Regular Expression (RegEx) matching. RegEx matching is a key function in network security, where deep packet inspection finds and filters out malicious actors. However, RegEx matching latency and power can be incredibly high and current proposals are challenged to perform wire-speed matching for large scale rulesets. Our approach dramatically decreases RegEx matching operating power, provides high throughput, and the use of mTCAMs enables novel compression techniques to expand ruleset sizes and allows future exploitation of the multi-state (analog) capabilities of memristors. We fabricated and demonstrated nanoscale memristor TCAM cells. SPICE simulations investigate mTCAM performance at scale and a mTCAM power model at 22nm demonstrates 0.2 fJ/bit/search energy for a 36x400 mTCAM. We further propose a tiled architecture which implements a Snort ruleset and assess the application performance. Compared to a state-of-the-art FPGA approach (2 Gbps,\textbackslashtextasciitilde1W), we show x4 throughput (8 Gbps) at 60% the power (0.62W) before applying standard TCAM power-saving techniques. Our performance comparison improves further when striding (searching multiple characters) is considered, resulting in 47.2 Gbps at 1.3W for our approach compared to 3.9 Gbps at 630mW for the strided FPGA NFA, demonstrating a promising path to wire-speed RegEx matching on large scale rulesets.

URLhttp://doi.acm.org/10.1145/3232195.3232201
DOI10.1145/3232195.3232201
Citation Keygraves_regular_2018