Hardware acceleration of signature matching through multi-layer transition bit masking

S. Shankar, Pinxing Lin, A. Herkersdorf, Thomas Wild
{"title":"Hardware acceleration of signature matching through multi-layer transition bit masking","authors":"S. Shankar, Pinxing Lin, A. Herkersdorf, Thomas Wild","doi":"10.1109/ATNAC.2016.7878812","DOIUrl":null,"url":null,"abstract":"Content aware networking will be an integral feature in the next generation Residential Gateway Routers (RGR). Signature matching is the most time critical operation in content aware networking. Improving broadband speed necessitates the need for hardware acceleration of signature matching to manage and safeguard all the Internet of Things (IOT) clients connected to the smart home. Deterministic Finite Automata (DFA) allows the signature matching operation to be performed in linear time but has an exponential storage complexity. Bitmap based transition compression techniques are hardware friendly and can be used to achieve signature matching at multi gigabit throughput. However, its drawback is inefficient transition compression which results in storage of redundant transitions after the compression. We propose two bit masking techniques to efficiently compress transitions over existing bitmap based techniques. Compression ratios of 98% can be achieved using the proposed techniques, which in turn results in a 50% reduction of memory usage to store the compressed automata. A hardware acceleration architecture is proposed for each technique to decompress the transitions to achieve signature matching at multi gigabit rates.","PeriodicalId":317649,"journal":{"name":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 26th International Telecommunication Networks and Applications Conference (ITNAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ATNAC.2016.7878812","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Content aware networking will be an integral feature in the next generation Residential Gateway Routers (RGR). Signature matching is the most time critical operation in content aware networking. Improving broadband speed necessitates the need for hardware acceleration of signature matching to manage and safeguard all the Internet of Things (IOT) clients connected to the smart home. Deterministic Finite Automata (DFA) allows the signature matching operation to be performed in linear time but has an exponential storage complexity. Bitmap based transition compression techniques are hardware friendly and can be used to achieve signature matching at multi gigabit throughput. However, its drawback is inefficient transition compression which results in storage of redundant transitions after the compression. We propose two bit masking techniques to efficiently compress transitions over existing bitmap based techniques. Compression ratios of 98% can be achieved using the proposed techniques, which in turn results in a 50% reduction of memory usage to store the compressed automata. A hardware acceleration architecture is proposed for each technique to decompress the transitions to achieve signature matching at multi gigabit rates.
基于多层过渡位掩码的签名匹配硬件加速
内容感知网络将是下一代住宅网关路由器(RGR)的一个不可或缺的功能。签名匹配是内容感知网络中最耗时的操作。提高宽带速度需要硬件加速签名匹配,以管理和保护所有连接到智能家居的物联网客户端。确定性有限自动机(Deterministic Finite Automata, DFA)允许签名匹配操作在线性时间内完成,但具有指数级的存储复杂度。基于位图的转换压缩技术是硬件友好的,可用于实现多千兆吞吐量的签名匹配。然而,它的缺点是转换压缩效率低,导致压缩后存储冗余的转换。我们提出了两种位掩码技术,以有效地压缩过渡超过现有的基于位图的技术。使用所提出的技术可以实现98%的压缩比,这反过来又导致用于存储压缩自动机的内存使用减少50%。为实现多千兆速率的签名匹配,提出了每种技术的硬件加速架构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信