Regular Expression Matching with Memristor TCAMs for Network Security
| Autor: | Sai Rahul Chalamalasetti, Matthew P. Hardy, Le Zheng, Xia Sheng, Catherine Graves, Martin Foltin, Brent Buchanan, Si-Ty Lam, Xuema Li, Wen Ma, John Paul Strachan, Lennie Kiyama |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
020203 distributed computing
Finite-state machine Network security business.industry Computer science 020208 electrical & electronic engineering Deep packet inspection 02 engineering and technology Memristor Content-addressable memory Telecommunications network law.invention Computer architecture law 0202 electrical engineering electronic engineering information engineering Regular expression Field-programmable gate array business |
| Zdroj: | NANOARCH |
| DOI: | 10.1145/3232195.3232201 |
| Popis: | 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 36×400 mTCAM. We further propose a tiled architecture which implements a Snort rule-set and assess the application performance. Compared to a state-of-the-art FPGA approach (2 Gbps, −1W), we show ×4 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|