High-throughput hash-based online traffic classification engines on FPGA

Vaibhav R. Gandhi, Yun Qu, V. Prasanna
{"title":"High-throughput hash-based online traffic classification engines on FPGA","authors":"Vaibhav R. Gandhi, Yun Qu, V. Prasanna","doi":"10.1109/ReConFig.2014.7032530","DOIUrl":null,"url":null,"abstract":"Traffic classification is used to perform important network management tasks such as flow prioritization and traffic shaping/pricing. Machine learning techniques such as the C4.5 algorithm can be used to perform traffic classification with very high levels of accuracy; however, realizing high-performance online traffic classification engine is still challenging. In this paper, we propose a high-throughput architecture for online traffic classification on FPGA. We convert the C4.5 decision-tree into multiple hash tables. We construct a pipelined architecture consisting of multiple processing elements; each hash table is searched in a processing element independently. The throughput is further increased by using multiple pipelines in parallel. To evaluate the performance of our architecture, we implement it on a state-of-the-art FPGA. Post-place-and-route results show that, for a typical 128-leaf decision-tree used for online traffic classification, our classification engine sustains a throughput of 1654 Million Classifications Per Second (MCPS). Our architecture sustains high throughput even if the number of leaves in the decision-tree is scaled up to 1K. Compared to existing online traffic classification engines on various platforms, we achieve at least 3.5× speedup with respect to throughput.","PeriodicalId":137331,"journal":{"name":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on ReConFigurable Computing and FPGAs (ReConFig14)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ReConFig.2014.7032530","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Traffic classification is used to perform important network management tasks such as flow prioritization and traffic shaping/pricing. Machine learning techniques such as the C4.5 algorithm can be used to perform traffic classification with very high levels of accuracy; however, realizing high-performance online traffic classification engine is still challenging. In this paper, we propose a high-throughput architecture for online traffic classification on FPGA. We convert the C4.5 decision-tree into multiple hash tables. We construct a pipelined architecture consisting of multiple processing elements; each hash table is searched in a processing element independently. The throughput is further increased by using multiple pipelines in parallel. To evaluate the performance of our architecture, we implement it on a state-of-the-art FPGA. Post-place-and-route results show that, for a typical 128-leaf decision-tree used for online traffic classification, our classification engine sustains a throughput of 1654 Million Classifications Per Second (MCPS). Our architecture sustains high throughput even if the number of leaves in the decision-tree is scaled up to 1K. Compared to existing online traffic classification engines on various platforms, we achieve at least 3.5× speedup with respect to throughput.
基于FPGA的高通量哈希在线流量分类引擎
流量分类用于执行重要的网络管理任务,如流量优先级和流量整形/定价。机器学习技术,如C4.5算法,可用于执行流量分类,具有非常高的准确性;然而,实现高性能的在线流量分类引擎仍然具有挑战性。本文提出了一种基于FPGA的在线流量分类的高吞吐量架构。我们将C4.5决策树转换为多个哈希表。我们构建了一个由多个处理元素组成的流水线架构;在处理元素中独立搜索每个哈希表。通过并行使用多个管道,进一步提高了吞吐量。为了评估我们架构的性能,我们在最先进的FPGA上实现了它。放置和路由后的结果表明,对于用于在线流量分类的典型128叶决策树,我们的分类引擎保持了每秒16.54亿个分类(MCPS)的吞吐量。即使决策树中的叶子数扩展到1K,我们的架构也能保持高吞吐量。与各种平台上现有的在线流量分类引擎相比,我们在吞吐量方面实现了至少3.5倍的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信