EPC:一个集成包分类框架,具有高效和稳定的性能

IF 4.4 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Haiyang Ren , Shiyou Qian , Zhonglong Zheng , Jiange Zhang , Zhengyu Liao , Hanwen Hu , Jian Cao , Guangtao Xue , Minglu Li
{"title":"EPC:一个集成包分类框架,具有高效和稳定的性能","authors":"Haiyang Ren ,&nbsp;Shiyou Qian ,&nbsp;Zhonglong Zheng ,&nbsp;Jiange Zhang ,&nbsp;Zhengyu Liao ,&nbsp;Hanwen Hu ,&nbsp;Jian Cao ,&nbsp;Guangtao Xue ,&nbsp;Minglu Li","doi":"10.1016/j.comnet.2025.111306","DOIUrl":null,"url":null,"abstract":"<div><div>The increasing demands of emerging network applications have compelled routers to offer enhanced functions, such as traffic accounting and quality of service (QoS). These functions rely heavily on packet classification. With network transmission speeds reaching unprecedented levels, the optimization of throughput has become a common practice. One such method is the deployment of multiple algorithm replicas with the best parameter configuration for parallel packet classification. However, this solution fails to address the issue of performance fluctuations in individual specific instance of algorithm (SIA). This is because most algorithms prioritize the optimization of average lookup speed, often neglecting overall performance stability. Our evaluation of five state-of-the-art algorithms has revealed that these algorithms commonly suffer from performance fluctuations due to data skewness. To address this issue, this work proposes a novel solution called Ensemble Packet Classification (EPC) that aims to achieve efficient and stable performance. EPC leverages the principles of ensemble learning to generate an optimal combination scheme of diverse SIAs that exhibit similar performance but possess complementary characteristics. To evaluate the effectiveness of EPC, we select five state-of-the-art algorithms as baselines. The experiment results show that when augmented with EPC, the throughput of parallel solutions based on these algorithms increases by 12.07%–19.26%. Additionally, the 95th percentile of lookup time is reduced by 14.78%–26.77%. By fully harnessing the complementarity of SIAs, EPC effectively addresses the issue of long-tail while increasing throughput.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"265 ","pages":"Article 111306"},"PeriodicalIF":4.4000,"publicationDate":"2025-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"EPC: An ensemble packet classification framework for efficient and stable performance\",\"authors\":\"Haiyang Ren ,&nbsp;Shiyou Qian ,&nbsp;Zhonglong Zheng ,&nbsp;Jiange Zhang ,&nbsp;Zhengyu Liao ,&nbsp;Hanwen Hu ,&nbsp;Jian Cao ,&nbsp;Guangtao Xue ,&nbsp;Minglu Li\",\"doi\":\"10.1016/j.comnet.2025.111306\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>The increasing demands of emerging network applications have compelled routers to offer enhanced functions, such as traffic accounting and quality of service (QoS). These functions rely heavily on packet classification. With network transmission speeds reaching unprecedented levels, the optimization of throughput has become a common practice. One such method is the deployment of multiple algorithm replicas with the best parameter configuration for parallel packet classification. However, this solution fails to address the issue of performance fluctuations in individual specific instance of algorithm (SIA). This is because most algorithms prioritize the optimization of average lookup speed, often neglecting overall performance stability. Our evaluation of five state-of-the-art algorithms has revealed that these algorithms commonly suffer from performance fluctuations due to data skewness. To address this issue, this work proposes a novel solution called Ensemble Packet Classification (EPC) that aims to achieve efficient and stable performance. EPC leverages the principles of ensemble learning to generate an optimal combination scheme of diverse SIAs that exhibit similar performance but possess complementary characteristics. To evaluate the effectiveness of EPC, we select five state-of-the-art algorithms as baselines. The experiment results show that when augmented with EPC, the throughput of parallel solutions based on these algorithms increases by 12.07%–19.26%. Additionally, the 95th percentile of lookup time is reduced by 14.78%–26.77%. By fully harnessing the complementarity of SIAs, EPC effectively addresses the issue of long-tail while increasing throughput.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"265 \",\"pages\":\"Article 111306\"},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2025-04-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625002749\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625002749","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

新兴网络应用日益增长的需求迫使路由器提供增强的功能,如流量计费和服务质量(QoS)。这些功能在很大程度上依赖于数据包分类。随着网络传输速度达到前所未有的水平,吞吐量优化已成为一种普遍做法。其中一种方法是为并行分组分类部署具有最佳参数配置的多个算法副本。然而,该解决方案无法解决单个特定算法实例(SIA)的性能波动问题。这是因为大多数算法优先考虑平均查找速度的优化,往往忽略了整体性能稳定性。我们对五种最先进算法的评估表明,由于数据偏性,这些算法通常会受到性能波动的影响。为了解决这个问题,本工作提出了一种新的解决方案,称为集成分组分类(EPC),旨在实现高效和稳定的性能。EPC利用集成学习的原理来生成具有相似性能但具有互补特征的各种SIAs的最优组合方案。为了评估EPC的有效性,我们选择了五种最先进的算法作为基准。实验结果表明,当增强EPC时,基于这些算法的并行解的吞吐量提高了12.07% ~ 19.26%。此外,查找时间的第95百分位数减少了14.78%-26.77%。通过充分利用SIAs的互补性,EPC在提高吞吐量的同时有效地解决了长尾问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EPC: An ensemble packet classification framework for efficient and stable performance
The increasing demands of emerging network applications have compelled routers to offer enhanced functions, such as traffic accounting and quality of service (QoS). These functions rely heavily on packet classification. With network transmission speeds reaching unprecedented levels, the optimization of throughput has become a common practice. One such method is the deployment of multiple algorithm replicas with the best parameter configuration for parallel packet classification. However, this solution fails to address the issue of performance fluctuations in individual specific instance of algorithm (SIA). This is because most algorithms prioritize the optimization of average lookup speed, often neglecting overall performance stability. Our evaluation of five state-of-the-art algorithms has revealed that these algorithms commonly suffer from performance fluctuations due to data skewness. To address this issue, this work proposes a novel solution called Ensemble Packet Classification (EPC) that aims to achieve efficient and stable performance. EPC leverages the principles of ensemble learning to generate an optimal combination scheme of diverse SIAs that exhibit similar performance but possess complementary characteristics. To evaluate the effectiveness of EPC, we select five state-of-the-art algorithms as baselines. The experiment results show that when augmented with EPC, the throughput of parallel solutions based on these algorithms increases by 12.07%–19.26%. Additionally, the 95th percentile of lookup time is reduced by 14.78%–26.77%. By fully harnessing the complementarity of SIAs, EPC effectively addresses the issue of long-tail while increasing throughput.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术官方微信