Short-Term Memory Sampling for Spread Measurement in High-Speed Networks

被引:10
作者
Du, Yang [1 ]
Huang, He [1 ]
Sun, Yu-E [2 ]
Chen, Shigang [3 ]
Gao, Guoju [1 ]
Wang, Xiaoyu [1 ]
Xu, Shenghui [1 ]
机构
[1] Soochow Univ, Sch Comp Sci & Technol, Suzhou, Peoples R China
[2] Soochow Univ, Sch Rail Transportat, Suzhou, Peoples R China
[3] Univ Florida, Dept Comp & Informat Sci & Engn, Gainesville, FL 32611 USA
来源
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022) | 2022年
基金
中国国家自然科学基金;
关键词
Traffic measurement; spread estimation; short-term memory sampling; TRAFFIC MEASUREMENT; FLOW STATISTICS; FILTER; ESTIMATOR;
D O I
10.1109/INFOCOM48880.2022.9796702
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Per-flow spread measurement in high-speed networks can provide indispensable information to many practical applications. However, it is challenging to measure millions of flows at line speed because on-chip memory modules cannot simultaneously provide large capacity and large bandwidth. The prior studies address this mismatch by entirely using on-chip compact data structures or utilizing off-chip space to assist limited on-chip memory. Nevertheless, their on-chip data structures record massive transient elements, each of which only appears in a short time interval in a long-period measurement task, and thus waste significant on-chip space. This paper presents shortterm memory sampling, a novel spread estimator that samples new elements while only holding elements for short periods. Our estimator can work with tiny on-chip space and provide accurate estimations for online queries. The key of our design is a short-term memory duplicate filter that reports new elements and filters duplicates effectively while allowing incoming elements to override the stale elements to reduce on-chip memory usage. We implement our approach on a NetFPGA-equipped prototype. Experimental results based on real Internet traces show that, compared to the state-of-the-art, short-term memory sampling reduces up to 99% of on-chip memory usage when providing the same probabilistic assurance on spread-estimation error.
引用
收藏
页码:470 / 479
页数:10
相关论文
共 35 条
[1]  
[Anonymous], The caida ucsd anonymized internet traces 2015
[2]  
[Anonymous], 2021, SOURCE CODE RELATED
[3]   Randomized Admission Policy for Efficient Top-k, Frequency, and Volume Estimation [J].
Ben Basat, Ran ;
Chen, Xiaoqi ;
Einziger, Gil ;
Friedman, Roy ;
Kassner, Yaron .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (04) :1432-1445
[4]   Cardinality Estimation in a Virtualized Network Device Using Online Machine Learning [J].
Cohen, Reuven ;
Nezri, Yuval .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2019, 27 (05) :2098-2110
[5]   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
[6]  
Deng F., 2006, SIGMOD 06, P25, DOI DOI 10.1145/1142473.1142477
[7]   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,
[8]   Online High-Cardinality Flow Detection over Big Network Data Stream [J].
Du, Yang ;
Huang, He ;
Sun, Yu-E ;
Liu, An ;
Gao, Guoju ;
Zhang, Boyu .
DATABASE SYSTEMS FOR ADVANCED APPLICATIONS (DASFAA 2021), PT I, 2021, 12681 :405-421
[9]   Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams [J].
Dutta, Sourav ;
Narang, Ankur ;
Bera, Suman K. .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (08) :589-600
[10]   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