An Efficient Adaptive Denoising Sketch for Per-flow Traffic Measurement

被引:3
作者
Lou, Chen [1 ]
Sun, Yu-E [2 ]
Huang, He [3 ]
Du, Yang [3 ]
Chen, Shigang [4 ]
Gao, Guoju [3 ]
Xu, Hongli [1 ]
机构
[1] Univ Sci & Technol China, Sch Comp Sci & Technol, Hefei, Peoples R China
[2] Soochow Univ, Sch Rail Transportat, Suzhou, Peoples R China
[3] Soochow Univ, Sch Comp Sci & Technol, Suzhou, Peoples R China
[4] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL USA
来源
2022 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE, IPCCC | 2022年
基金
中国国家自然科学基金;
关键词
Traffic measurement; size estimation; sketch; adaptive denoising; NETWORKS;
D O I
10.1109/IPCCC55026.2022.9894330
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Per-flow size measurement is a fundamental problem in network engineering and plays a pivotal role in many practical applications. Constrained by on-chip memory resources and packet processing speed, most existing solutions use compact data structures (i.e., sketches) to perform the line-speed measurement. However, sketches share the record units (bits/counters) among flows, inevitably introducing noises to each flows measurement result. Although they adopt an average denoising strategy to remove noises from the raw estimations, the accuracy for medium flows is still lacking. This paper complements the prior art and presents a novel per-flow size measurement method, Adaptive Denoising (ADN), which can provide more accurate estimates for online and offline queries. For an online query, we use the collected flow records for real-time estimation. For an offline query, we model the propagation of noises based on the optimization algorithm to produce flow size estimation with much better accuracy. Experimental results based on real Internet traffic traces show that our measurement solutions outperform the state-of-the-art approaches and reduce the mean absolute error by around one order of magnitude under the same on-chip memory usage.
引用
收藏
页数:8
相关论文
共 20 条
[1]  
[Anonymous], The caida ucsd anonymized internet traces 2015
[2]  
Ben-Basat R, 2016, IEEE INFOCOM SER
[3]   Finding frequent items in data streams [J].
Charikar, M ;
Chen, K ;
Farach-Colton, M .
THEORETICAL COMPUTER SCIENCE, 2004, 312 (01) :3-15
[4]   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
[5]   An improved data stream summary: the count-min sketch and its applications [J].
Cormode, G ;
Muthukrishnan, S .
JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2005, 55 (01) :58-75
[6]  
Deng Fan, 2007, Webdocs
[7]   Deriving traffic demands for operational IP networks: Methodology and experience [J].
Feldmann, A ;
Greenberg, A ;
Lund, C ;
Reingold, N ;
Rexford, J ;
True, F .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2001, 9 (03) :265-279
[8]  
King DB, 2015, ACS SYM SER, V1214, P1, DOI 10.1021/bk-2015-1214.ch001
[9]  
Krishnamurthy B., 2003, P 3 ACM SIGCOMM C IN, P234, DOI DOI 10.1145/948205.948236
[10]  
Li T, 2011, IEEE INFOCOM SER, P3200, DOI 10.1109/INFCOM.2011.5935169