arrow
返回

Efficient Lightweight Coordinated Sampling for Dynamic Flows: Theory and Implementation

delete2026-01-01
delete0
PRE
AI
M
M.J. Chen
T
Thomas La Porta
T
Trent Jaeger
S
Srikanth V. Krishnamurthy
DOI:10.1109/TON.2025.3644238delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
As cyber-attacks on networks become stealthier, monitoring techniques relying on low-rate packet sampling may prove insufficient to detect attacks. While various methods, such as truncating packets, flow-based sampling, and adaptive sampling rates, have been proposed to enhance detection rates and ease capability limitations, it remains challenging to perform sufficient sampling at line speed and high rates at a single sampling point due to limited CPU or bandwidth capacity and fluctuating network traffic. To address these challenges, we propose CoordSamp, a system that distributes the sampling workload across multiple sampling points and coordinates their actions to avoid duplicate sampling of the same packet. This design enables scalable, resource-aware monitoring—particularly suited for dynamic, agentless cloud-based environments—relying solely on network-level deployment that can be dynamically assigned and adjusted by the provider. We develop a coordinated sampling algorithm on multiple P4-programmable switches and show that the algorithm ensures coordination among multiple sampling points for each flow, preventing duplicate samples, with negligible network overhead and real-time configurability. At its core, CoordSamp separates offline placement—the budgeted selection of sampling points—from online allocation—the capacity-aware assignment of sampling tasks—allowing practical deployment in hybrid networks that combine programmable and legacy switches. We formulate sampling point placement as budgeted maximum multi-coverage problems, solving them optimally in pseudo-polynomial time. Our system far outperforms those based on greedy placement along many key dimensions.
Keyword:
P4-programmable switch
coordinated sampling
budgeted maximum multi-coverage
balanced matrix

期刊

I
IEEE Transactions on Networking
IF:
0
论文数:
551
被引数:
0

机构

U
university of california riverside
学者数:
1.1W
论文数: 8.3K
被引数: 16
P
pennsylvania state university
学者数:
3.3K
论文数: 1.9K
被引数: 0
K
kansas state university
学者数:
1.3K
论文数: 482
被引数: 0
学者 查看更多机构
引用论文

引用论文

err分享
err收藏
P4
err2014-07-28
err0
PREAI
errPat Bosshart; Dan Daly; Glen Gibb; Martin Izzard; Nick McKeown; Jennifer Rexford; Cole Schlesinger; Dan Talayco; Amin Vahdat; George Varghese; David Walker
err分享
err收藏
Per-Flow Network Measurement With Distributed Sketch
err2024-02-01
err4
PREAI
errGu, Liyuan; Tian, Ye; Chen, Wei; Wei, Zhongxiang; Wang, Cenman; Zhang, Xinming
err分享
err收藏
The budgeted maximum coverage problem
err1999-04-01
err0
PREAI
errSamir Khuller; Anna Moss; Joseph (Seffi) Naor
err分享
err收藏
SNDlib 1.0—Survivable Network Design Library
err2009-10-19
err0
errOAAI
errS. Orlowski; R. Wessäly; M. Pióro; A. Tomaszewski
err分享
err收藏
Online Spread Estimation with Non-duplicate Sampling
err2020-07-01
err0
PREAI
errYu-E Sun; He Huang; Chaoyi Ma; Shigang Chen; Yang Du; Qingjun Xiao
err分享
err收藏
学者 查看更多内容