SwinTop: Optimizing memory efficiency of packet classification in network devices

Chang Chen, Liangwei Cai, Yang Xiang, Jun Li
{"title":"SwinTop: Optimizing memory efficiency of packet classification in network devices","authors":"Chang Chen, Liangwei Cai, Yang Xiang, Jun Li","doi":"10.1109/ICCSN.2015.7296139","DOIUrl":null,"url":null,"abstract":"Packet classification is one of the key functionalities provided by network devices for QoS and network security purposes. Recently the rapid growth of classification ruleset size and ruleset complexity has caused memory performance woes when applying traditional packet classification algorithms. Inheriting the divide-and-conquer idea of pre-partitioning the original rules into several groups for significant reduction of memory overhead, this paper proposes Swin Top, a new ruleset partitioning approach based on swarm intelligent optimization algorithms, to seek for the global optimum grouping of rules. To enhance convergence accuracy and speed up the iterative process, Swin Top employs several novel ideas, such as the introduction of grouping penalty, the combination of PSO and GA, and a new memory usage estimation method. On the publicly available rulesets from Class Bench, SwinTop is shown to achieve 1 to 4 orders of magnitude lower memory consumption than simply applying a traditional packet classification algorithm without ruleset partitioning, and outperform the state-of-the-art partitioning algorithms EffiCuts and ParaSplit on all kinds of large-sized rulesets.","PeriodicalId":319517,"journal":{"name":"2015 IEEE International Conference on Communication Software and Networks (ICCSN)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Software and Networks (ICCSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSN.2015.7296139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Packet classification is one of the key functionalities provided by network devices for QoS and network security purposes. Recently the rapid growth of classification ruleset size and ruleset complexity has caused memory performance woes when applying traditional packet classification algorithms. Inheriting the divide-and-conquer idea of pre-partitioning the original rules into several groups for significant reduction of memory overhead, this paper proposes Swin Top, a new ruleset partitioning approach based on swarm intelligent optimization algorithms, to seek for the global optimum grouping of rules. To enhance convergence accuracy and speed up the iterative process, Swin Top employs several novel ideas, such as the introduction of grouping penalty, the combination of PSO and GA, and a new memory usage estimation method. On the publicly available rulesets from Class Bench, SwinTop is shown to achieve 1 to 4 orders of magnitude lower memory consumption than simply applying a traditional packet classification algorithm without ruleset partitioning, and outperform the state-of-the-art partitioning algorithms EffiCuts and ParaSplit on all kinds of large-sized rulesets.
SwinTop:优化网络设备中报文分类的内存效率
数据包分类是网络设备为QoS和网络安全目的提供的关键功能之一。近年来,分类规则集大小和复杂度的快速增长,给传统的分组分类算法带来了内存性能问题。继承分而治之的思想,将原始规则预先划分为若干组,以显著减少内存开销,本文提出了一种新的基于群智能优化算法的规则集划分方法Swin Top,以寻求全局最优的规则分组。为了提高收敛精度和加快迭代过程,Swin Top采用了一些新颖的思想,如引入分组惩罚、粒子群算法和遗传算法的结合以及新的内存使用估计方法。在Class Bench公开可用的规则集上,SwinTop比简单地应用传统的数据包分类算法而不使用规则集分区实现了1到4个数量级的内存消耗,并且在各种大型规则集上优于最先进的分区算法EffiCuts和ParaSplit。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信