CPSketch: A ‘couple’ sketch-based heavy flow detection method

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Renpin Yao , Yang Cao , Yunhe Cui , Yi Chen , Chun Guo , Guowei Shen
{"title":"CPSketch: A ‘couple’ sketch-based heavy flow detection method","authors":"Renpin Yao ,&nbsp;Yang Cao ,&nbsp;Yunhe Cui ,&nbsp;Yi Chen ,&nbsp;Chun Guo ,&nbsp;Guowei Shen","doi":"10.1016/j.jnca.2025.104245","DOIUrl":null,"url":null,"abstract":"<div><div>One of the core challenges in network measurement for large-scale networks is the accurate and efficient identification of heavy flows. This task has grown increasingly complex due to limited memory resources and the dynamic nature of network traffic patterns. Most current heavy flow detection methods fail to fully consider the mutual collisions between large flows and their sparse distribution, which are caused by the combined effects of hash collisions and the heavy-tailed distribution of network traffic, resulting in an inefficient use of limited memory resources. Additionally, existing approaches uniformly treat all flows. As a result, when the network contains many small flows, heavy flows are frequently and erroneously replaced. To address these issues, we propose CPSketch, a novel method that combines sketch with ‘couple’ buckets to enhance heavy flow detection accuracy. CPSketch optimizes memory utilization by leveraging cold buckets to store more heavy flows. Specifically, it accurately estimates flow sizes by monitoring the number of matched packets for candidate flows in real-time. For small flows, CPSketch rapidly identifies and evicts them based on flow ratios. For other flows, CPSketch calculates replacement probabilities using multidimensional statistical information. To protect heavy flows that have been incorrectly evicted, CPSketch employs a global hash function to provide additional storage opportunities and dynamically constructs couple buckets for these heavy flows. Moreover, CPSketch extends the selection range for minimum flows by leveraging couple buckets in the flow replacement policy, effectively mitigating the impact of hash limitations and improving memory efficiency. Experimental results from trace-driven simulations and Open vSwitch (OVS) tests demonstrate that CPSketch outperforms existing methods in accuracy, even under constrained memory and high traffic loads. It achieves improvements of up to 14.74 % in F1-score while reducing the Average Relative Error (ARE) by 41.72 % and the Average Absolute Error (AAE) by 42.18 %.</div></div>","PeriodicalId":54784,"journal":{"name":"Journal of Network and Computer Applications","volume":"242 ","pages":"Article 104245"},"PeriodicalIF":7.7000,"publicationDate":"2025-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Network and Computer Applications","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1084804525001420","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

One of the core challenges in network measurement for large-scale networks is the accurate and efficient identification of heavy flows. This task has grown increasingly complex due to limited memory resources and the dynamic nature of network traffic patterns. Most current heavy flow detection methods fail to fully consider the mutual collisions between large flows and their sparse distribution, which are caused by the combined effects of hash collisions and the heavy-tailed distribution of network traffic, resulting in an inefficient use of limited memory resources. Additionally, existing approaches uniformly treat all flows. As a result, when the network contains many small flows, heavy flows are frequently and erroneously replaced. To address these issues, we propose CPSketch, a novel method that combines sketch with ‘couple’ buckets to enhance heavy flow detection accuracy. CPSketch optimizes memory utilization by leveraging cold buckets to store more heavy flows. Specifically, it accurately estimates flow sizes by monitoring the number of matched packets for candidate flows in real-time. For small flows, CPSketch rapidly identifies and evicts them based on flow ratios. For other flows, CPSketch calculates replacement probabilities using multidimensional statistical information. To protect heavy flows that have been incorrectly evicted, CPSketch employs a global hash function to provide additional storage opportunities and dynamically constructs couple buckets for these heavy flows. Moreover, CPSketch extends the selection range for minimum flows by leveraging couple buckets in the flow replacement policy, effectively mitigating the impact of hash limitations and improving memory efficiency. Experimental results from trace-driven simulations and Open vSwitch (OVS) tests demonstrate that CPSketch outperforms existing methods in accuracy, even under constrained memory and high traffic loads. It achieves improvements of up to 14.74 % in F1-score while reducing the Average Relative Error (ARE) by 41.72 % and the Average Absolute Error (AAE) by 42.18 %.
CPSketch:一种基于“一对”草图的大流量检测方法
大网络测量的核心挑战之一是如何准确、高效地识别大流量。由于有限的内存资源和网络流量模式的动态性,这项任务变得越来越复杂。目前大多数大流检测方法没有充分考虑大流之间的相互冲突及其稀疏分布,这种冲突是由哈希冲突和网络流量的重尾分布共同作用造成的,导致有限的内存资源使用效率低下。此外,现有的方法统一地处理所有流。因此,当网络中包含许多小流量时,大流量经常被错误地替换。为了解决这些问题,我们提出了一种将草图与“一对”桶相结合的新方法CPSketch,以提高大流量检测的准确性。CPSketch通过利用冷桶来存储更多的重流来优化内存利用率。具体来说,它通过实时监控候选流的匹配数据包数量来准确估计流的大小。对于小流量,CPSketch可以根据流量比率快速识别并排除它们。对于其他流,CPSketch使用多维统计信息计算替换概率。为了保护被错误驱逐的大流量,CPSketch使用了一个全局散列函数来提供额外的存储机会,并动态地为这些大流量构建了几个bucket。此外,CPSketch通过在流替换策略中利用一对桶扩展了最小流的选择范围,有效地减轻了哈希限制的影响并提高了内存效率。跟踪驱动仿真和Open vSwitch (OVS)测试的实验结果表明,即使在受限的内存和高流量负载下,CPSketch在准确性方面也优于现有方法。结果表明,该方法可使f1分数提高14.74%,平均相对误差(ARE)降低41.72%,平均绝对误差(AAE)降低42.18%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of Network and Computer Applications
Journal of Network and Computer Applications 工程技术-计算机:跨学科应用
CiteScore
21.50
自引率
3.40%
发文量
142
审稿时长
37 days
期刊介绍: The Journal of Network and Computer Applications welcomes research contributions, surveys, and notes in all areas relating to computer networks and applications thereof. Sample topics include new design techniques, interesting or novel applications, components or standards; computer networks with tools such as WWW; emerging standards for internet protocols; Wireless networks; Mobile Computing; emerging computing models such as cloud computing, grid computing; applications of networked systems for remote collaboration and telemedicine, etc. The journal is abstracted and indexed in Scopus, Engineering Index, Web of Science, Science Citation Index Expanded and INSPEC.
×
引用
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学术官方微信