Expiration filter: Mining recent heavy flows in high-speed networks

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-02-01 Epub Date: 2025-01-02 DOI:10.1016/j.comnet.2024.111010
Yifan Han , He Huang , Yu-E Sun , Jia Liu , Shigang Chen
{"title":"Expiration filter: Mining recent heavy flows in high-speed networks","authors":"Yifan Han ,&nbsp;He Huang ,&nbsp;Yu-E Sun ,&nbsp;Jia Liu ,&nbsp;Shigang Chen","doi":"10.1016/j.comnet.2024.111010","DOIUrl":null,"url":null,"abstract":"<div><div>Mining recent heavy flows, which indicate the latest trends in high-speed networks, is vital to network management and numerous practical applications such as anomaly detection and congestion resolution. However, existing network traffic measurement solutions fall short of capturing and analyzing network traffic combined with temporal information, leaving us unaware of the real-time status of network streams, such as those undergoing congestion or attacks. This paper proposes the Expiration Filter (EF), which focuses on mining recent heavy flows, enhancing our understanding of the current behavioral patterns within the data. Given the skewness in real-world data streams, EF first filters out small flows to improve accuracy and tracks only flows with large volumes that have recently emerged. The EF also incorporates a dynamically self-cleaning mechanism to evict outdated records and free up memory space for new flows, thus fitting into the constrained on-chip space. Additionally, the adopted multi-stage design ensures the hardware implementation of EF in emerging programmable switches for line-rate processing. Hence, we provide detailed insights into implementing EF in programmable hardware under strict programming and resource constraints. Extensive experiments on real-world datasets demonstrate that EF outperforms the benchmarks in terms of flow size estimation, identifying top-<em>k</em> recent flows and detecting heavy hitters. All source codes are available at Github (<span><span>https://github.com/hanyifansuda/Expiration-Filter</span><svg><path></path></svg></span>).</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"258 ","pages":"Article 111010"},"PeriodicalIF":4.6000,"publicationDate":"2025-02-01","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/S1389128624008429","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/2 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

Abstract

Mining recent heavy flows, which indicate the latest trends in high-speed networks, is vital to network management and numerous practical applications such as anomaly detection and congestion resolution. However, existing network traffic measurement solutions fall short of capturing and analyzing network traffic combined with temporal information, leaving us unaware of the real-time status of network streams, such as those undergoing congestion or attacks. This paper proposes the Expiration Filter (EF), which focuses on mining recent heavy flows, enhancing our understanding of the current behavioral patterns within the data. Given the skewness in real-world data streams, EF first filters out small flows to improve accuracy and tracks only flows with large volumes that have recently emerged. The EF also incorporates a dynamically self-cleaning mechanism to evict outdated records and free up memory space for new flows, thus fitting into the constrained on-chip space. Additionally, the adopted multi-stage design ensures the hardware implementation of EF in emerging programmable switches for line-rate processing. Hence, we provide detailed insights into implementing EF in programmable hardware under strict programming and resource constraints. Extensive experiments on real-world datasets demonstrate that EF outperforms the benchmarks in terms of flow size estimation, identifying top-k recent flows and detecting heavy hitters. All source codes are available at Github (https://github.com/hanyifansuda/Expiration-Filter).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
过期过滤器:挖掘高速网络中最近的重流量
挖掘显示高速网络最新趋势的近期重流对于网络管理以及异常检测和拥塞解决等许多实际应用至关重要。然而,现有的网络流量测量解决方案缺乏结合时间信息捕获和分析网络流量的能力,使得我们无法了解网络流的实时状态,例如发生拥塞或攻击的网络流。本文提出了过期过滤器(Expiration Filter, EF),它专注于挖掘最近的重流量,增强我们对数据中当前行为模式的理解。考虑到现实世界数据流的不均匀性,EF首先过滤掉小流量以提高准确性,并只跟踪最近出现的大量流量。EF还集成了一个动态自清理机制,以清除过时的记录,并为新的流释放内存空间,从而适应有限的片上空间。此外,采用的多阶段设计确保了EF在新兴的可编程开关中用于线速率处理的硬件实现。因此,我们提供了在严格的编程和资源约束下在可编程硬件中实现EF的详细见解。在真实世界数据集上进行的大量实验表明,EF在流量大小估计、识别最近的top-k流量和检测重量级流量方面优于基准测试。所有源代码可在Github (https://github.com/hanyifansuda/Expiration-Filter)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
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.
期刊最新文献
From simulation to deep learning: Survey on network performance modeling approaches Eco-efficient task scheduling for MLLMs in edge-cloud continuum TraceX: Early-stage advanced persistent threat detection framework using semantic network traffic analysis Beyond flat identification: Exploiting site-page structure for hierarchical webpage fingerprinting RFD-R: AI-driven dynamic repacking framework for cloud-native O-RAN functions
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1