Adaptive Measurements Using One Elastic Sketch

被引:23
作者
Yang, Tong [1 ,2 ]
Jiang, Jie [1 ]
Liu, Peng [1 ]
Huang, Qun [3 ]
Gong, Junzhi [4 ]
Zhou, Yang [4 ]
Miao, Rui [5 ]
Li, Xiaoming [1 ]
Uhlig, Steve [6 ]
机构
[1] Peking Univ, Dept Comp & Sci, Beijing 100871, Peoples R China
[2] Peng Cheng Lab, Shenzhen 518052, Guangdong, Peoples R China
[3] Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China
[4] Harvard Univ, Cambridge, MA 02138 USA
[5] Alibaba Grp, Hangzhou 311121, Zhejiang, Peoples R China
[6] Queen Mary Univ London, Networks Sch EECS, London E1 4NS, England
关键词
Bandwidth; Task analysis; Size measurement; Measurement uncertainty; Data structures; Data centers; Sketches; network measurements; elastic; compression; generic;
D O I
10.1109/TNET.2019.2943939
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
When network is undergoing problems such as congestion, scan attack, DDoS attack, etc, measurements are much more important than usual. In this case, traffic characteristics including available bandwidth, packet rate, and flow size distribution vary drastically, significantly degrading the performance of measurements. To address this issue, we propose the Elastic sketch. It is adaptive to currently traffic characteristics. Besides, it is generic to measurement tasks and platforms. We implement the Elastic sketch on six platforms: P4, FPGA, GPU, CPU, multi-core CPU, and OVS, to process six typical measurement tasks. Experimental results and theoretical analysis show that the Elastic sketch can adapt well to traffic characteristics. Compared to the state-of-the-art, the Elastic sketch achieves 44.6 45.2 times faster speed and 2.0 273.7 smaller error rate.
引用
收藏
页码:2236 / 2251
页数:16
相关论文
共 62 条
[31]  
Kiss SZ, 2018, IEEE INFOCOM SER, P1412, DOI 10.1109/INFOCOM.2018.8486415
[32]  
Kumar A., 2004, Performance Evaluation Review, V32, P177, DOI 10.1145/1012888.1005709
[33]  
Lall A., 2006, ACM SIGMETRICS PERFO, P145
[34]  
Leland W. E., 1993, Computer Communication Review, V23, P183, DOI 10.1145/167954.166255
[35]   Approximate Query Processing: What is New and Where to Go?: A Survey on Approximate Query Processing [J].
Li, Kaiyu ;
Li, Guoliang .
DATA SCIENCE AND ENGINEERING, 2018, 3 (04) :379-397
[36]  
Li YL, 2016, 13TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION (NSDI '16), P311
[37]   One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon [J].
Liu, Zaoxing ;
Manousis, Antonis ;
Vorsanger, Gregory ;
Sekar, Vyas ;
Braverman, Vladimir .
PROCEEDINGS OF THE 2016 ACM CONFERENCE ON SPECIAL INTEREST GROUP ON DATA COMMUNICATION (SIGCOMM '16), 2016, :101-114
[38]  
Lu Y, 2008, PERF E R SI, V36, P121, DOI 10.1145/1384529.1375472
[39]  
Metwally A., 2005, P ICDT
[40]   Compressed bloom filters [J].
Mitzenmacher, M .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2002, 10 (05) :604-612