Multi-layer Adaptive Sampling for Per-Flow Spread Measurement

被引:1
作者
Zhang, Boyu [1 ]
Du, Yang [1 ]
Huang, He [1 ]
Sun, Yu-E [2 ]
Gao, Guoju [1 ]
Wang, Xiaoyu [1 ]
Chen, Shiping [3 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou, Jiangsu, Peoples R China
[2] Soochow Univ, Sch Rail Transportat, Suzhou, Jiangsu, Peoples R China
[3] Univ Shanghai Sci & Technol, Sch Opt Elect & Comp Engn, Shanghai, Peoples R China
来源
ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, ICA3PP 2021, PT I | 2022年 / 13155卷
基金
中国国家自然科学基金;
关键词
Traffic measurement; Spread estimation; Sampling; Adaptive sampling; High-speed networks; COUNTER ARCHITECTURE;
D O I
10.1007/978-3-030-95384-3_46
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Per-flow spread measurement in high-speed networks, which aims to estimate the number of distinct elements of each flow, plays an important role in many practical applications. Most existing solutions adopt compact data structures (i.e., sketches) to share memory units among flows so that they can fit in limited on-chip memory, resulting in low estimation accuracy for small flows. Unlike sketch-based solutions, non-duplicate sampling measures per-flow spreads by sampling each distinct element with the same sampling probability. However, it ignores that, compared to small flows, large flows only need lower sampling probabilities to achieve the same relative estimation error, wasting significant on-chip memory for large flows. This paper presents multi-layer adaptive sampling to complement the prior work by assigning lower probabilities to larger flows. The proposed framework employs a multi-layer model to sample distinct elements, ensuring that most small flows will stay in lower layers and large flows will get to higher layers. Besides, higher layers are designed with smaller overall probabilities to ensure that larger flows have lower sampling probabilities. Experimental results based on real Internet traces show that, compared to the state-of-the-art method, our solution can reduce up to 86% average relative errors for per-flow spread estimation and reduce the FPRs and FNRs of flow misclassification by around one to two magnitudes.
引用
收藏
页码:743 / 758
页数:16
相关论文
共 26 条
[1]  
[Anonymous], The caida ucsd anonymized internet traces 2015
[2]   Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement [J].
Chen, Min ;
Chen, Shigang ;
Cai, Zhiping .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2017, 25 (02) :1249-1262
[3]  
Choi BY, 2003, 2003 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-5, P1552
[4]   Identifying and Estimating Persistent Items in Data Streams [J].
Dai, Haipeng ;
Shahzad, Muhammad ;
Liu, Alex X. ;
Li, Meng ;
Zhong, Yuankun ;
Chen, Guihai .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2018, 26 (06) :2429-2442
[5]  
Dimitropoulos X, 2008, ACM SIGCOMM COMP COM, V38, P7, DOI 10.1145/1341431.1341433
[6]   Self-Adaptive Sampling for Network Traffic Measurement [J].
Du, Yang ;
Huang, He ;
Sun, Yu-E ;
Chen, Shigang ;
Gao, Guoju .
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2021), 2021,
[7]   Learn more, sample less: Control of volume and variance in network measurement [J].
Duffield, N ;
Lund, C ;
Thorup, M .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (05) :1756-1775
[8]  
Duffield N., 2004, Performance Evaluation Review, V32, P85, DOI 10.1145/1012888.1005699
[9]   New directions in traffic measurement and accounting: Focusing on the elephants, ignoring the mice [J].
Estan, C ;
Varghese, G .
ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2003, 21 (03) :270-313
[10]  
Fang Hao, 2004, Performance Evaluation Review, V32, P155, DOI 10.1145/1012888.1005707