One Memory Access Sketch: a More Accurate and Faster Sketch for Per-flow Measurement

被引:0
|
作者
Zhou, Yang [1 ]
Liu, Peng [1 ]
Jin, Hao [1 ]
Yang, Tong [1 ,2 ]
Dang, Shoujiang [3 ,4 ]
Li, Xiaoming [1 ]
机构
[1] Peking Univ, Dept Comp Sci & Technol, Beijing, Peoples R China
[2] NUDT, Collaborat Innovat Ctr High Performance Comp, Changsha, Hunan, Peoples R China
[3] Chinese Acad Sci, Natl Network New Media Engn Res Ctr, Inst Acoust, Beijing, Peoples R China
[4] Univ Chinese Acad Sci, Beijing, Peoples R China
来源
GLOBECOM 2017 - 2017 IEEE GLOBAL COMMUNICATIONS CONFERENCE | 2017年
关键词
COUNTER BRAIDS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Sketch is a probabilistic data structure widely used for per-flow measurement in the real network. The key metrics of sketches for per-flow measurement are their memory usage, accuracy, and speed. There are a variety of sketches, but they cannot achieve both high accuracy and high speed at the same time given a fixed memory size. To address this issue, we propose a new sketch, namely the OM (One Memory) sketch. It achieves much higher accuracy than the state-of-the-art, and achieves close to one memory access and one hash computation for each insertion or query. The key methodology of our OM sketch is to leverage word constraint and fingerprint techniques based on a hierarchical structure. Extensive experiments based on real IP traces show that the accuracy is improved up to 10.64 times while the speed is improved up to 2.50 times, compared with the well-known CM sketch [1]. All the related source code has been released at GitHub [2].
引用
收藏
页数:6
相关论文
共 50 条
  • [11] SketchFlow: Per-Flow Systematic Sampling Using Sketch Saturation Event
    Jang, Rhongho
    Min, DaeHong
    Moon, SeongKwang
    Mohaisen, David
    Nyang, DaeHun
    IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2020, : 1339 - 1348
  • [12] Tree sketch: An accurate and memory-efficient sketch for network-wide measurement
    Liu, Lei
    Ding, Tong
    Feng, Hui
    Yan, Zhongmin
    Lu, Xudong
    COMPUTER COMMUNICATIONS, 2022, 194 : 148 - 155
  • [13] Rhombus sketch: adaptive and more accurate sketch for streaming data
    Wei X.-H.
    Miao Y.-W.
    Wang X.-W.
    Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and Technology Edition), 2022, 52 (04): : 874 - 884
  • [14] CSH: Towards More Accurate Flow Measurement with Counter-Sketch-Hybrid Algorithm
    Hang, Zijun
    Wang, Yongjie
    Huang, Shuguang
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [15] PA-Sketch: A Fast and Accurate Sketch for Differentiated Flow Estimation
    Li, Sitan
    Huang, Jiawei
    Zhang, Wenlu
    Shao, Jing
    2023 IEEE 31ST INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS, ICNP, 2023,
  • [16] HBL-Sketch: A New Three-Tier Sketch for Accurate Network Measurement
    Zhao, Keyan
    Wang, Junxiao
    Qi, Heng
    Xie, Xin
    Zhou, Xiaobo
    Li, Keqiu
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING (ICA3PP 2019), PT I, 2020, 11944 : 48 - 59
  • [17] DAP-Sketch: An accurate and effective network measurement sketch with Deterministic Admission Policy
    Wang, Rui
    Du, Hongchao
    Shen, Zhaoyan
    Jia, Zhiping
    COMPUTER NETWORKS, 2021, 194
  • [18] Accurate and Efficient Per-Flow Latency Measurement Without Probing and Time Stamping
    Shahzad, Muhammad
    Liu, Alex X.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (06) : 3477 - 3492
  • [19] An effective and accurate flow size measurement using funnel-shaped sketch
    Liu, Jindian
    Li, Zhuo
    Du, Huipeng
    Zhou, Haodong
    Li, Leyang
    An, Yi
    Zhang, Yu
    Liu, Kaihua
    Li, Qiang
    COMPUTER NETWORKS, 2024, 247
  • [20] A generic sketch for estimating super-spreaders and per-flow cardinality distribution in high-speed data streams
    Zhang, Quanwei
    Xiao, Qingjun
    Cai, Yuexiao
    COMPUTER NETWORKS, 2023, 237