Cache Assisted Randomized Sharing Counters in Network Measurement-Reference-Cited by-同舟云学术

Cache Assisted Randomized Sharing Counters in Network Measurement

Published:2018-08-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 47th International Conference on Parallel Processing
language:
Short-container-title:

Author:

Liu Qian¹,Dai Haipeng¹,Liu Alex X.²,Li Qi³,Wang Xiaoyu¹,Zheng Jiaqi¹

Affiliation:

1. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China

2. State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China, Department of Computer Science and Engineering, Michigan State University, East Lansing, MI, USA

3. Air Force Engineering University, Xian, Shanxi, CHINA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3225058.3225078

Reference42 articles.

1. R. Basat G. Einziger R. Friedman and Y. Kassner. 2017. Optimal elephant flow detection. arXiv preprint arXiv:1701.04021 (2017). R. Basat G. Einziger R. Friedman and Y. Kassner. 2017. Optimal elephant flow detection. arXiv preprint arXiv:1701.04021 (2017).

2. Counter Tree: A Scalable Counter Architecture for Per-Flow Traffic Measurement

3. S. Chen M. Chen and Q. Xiao. 2017. Per-Flow Size Measurement. In Traffic Measurement for Big Network Data. Springer 11--45. S. Chen M. Chen and Q. Xiao. 2017. Per-Flow Size Measurement. In Traffic Measurement for Big Network Data. Springer 11--45.

4. H. Dai M. Li and A. Liu. 2018. Finding Persistent Items in Distributed Datasets. In IEEE INFOCOM. H. Dai M. Li and A. Liu. 2018. Finding Persistent Items in Distributed Datasets. In IEEE INFOCOM.

5. Finding persistent items in data streams

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. LSE: A Learning-based Per-flow Spread Estimation Framework for Network Data Streams;IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS);2022-05-02

2. Stingy sketch;Proceedings of the VLDB Endowment;2022-03