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 条
[11]  
Heule S., 2013, P 16 INT C EXTENDING, P683, DOI DOI 10.1145/2452376.2452456
[12]  
Hu CC, 2008, IEEE INFOCOM SER, P421
[13]  
Huang H, 2018, IEEE INFOCOM SER, P1898
[14]   Space-code bloom filter for efficient per-flow traffic measurement [J].
Kumar, Abhishek ;
JimXu, Jun ;
Wang, Jia .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2006, 24 (12) :2327-2339
[15]  
Li T, 2011, IEEE INFOCOM SER, P3200, DOI 10.1109/INFCOM.2011.5935169
[16]  
Lieven P, 2010, IEEE INFOCOM SER
[17]  
Lu Y, 2008, PERF E R SI, V36, P121, DOI 10.1145/1384529.1375472
[18]  
Sun YE, 2020, IEEE INFOCOM SER, P2440, DOI [10.1109/INFOCOM41043.2020.9155525, 10.1109/infocom41043.2020.9155525]
[19]  
Xiao Q., 2016, P IEEE GLOBECOM 2016, P1
[20]   Estimating the Persistent Spreads in High-speed Networks [J].
Xiao, Qingjun ;
Qiao, Yan ;
Zhen, Mo ;
Chen, Shigang .
2014 IEEE 22ND INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP), 2014, :131-142