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
关键词
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 条
  • [1] Accurate Per-Flow Measurement with Bloom Sketch
    Zhou, Yang
    Jin, Hao
    Liu, Peng
    Zhang, Haowei
    Yang, Tong
    Li, Xiaoming
    IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2018,
  • [2] Diamond Sketch: Accurate Per-flow Measurement for Real IP Streams
    Yang, Tong
    Gao, Siang
    Sun, Zhouyi
    Wang, Yufei
    Shen, Yulong
    Li, Xiaoming
    IEEE INFOCOM 2018 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2018,
  • [3] Per-Flow Network Measurement With Distributed Sketch
    Gu, Liyuan
    Tian, Ye
    Chen, Wei
    Wei, Zhongxiang
    Wang, Cenman
    Zhang, Xinming
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2024, 32 (01) : 411 - 426
  • [4] Diamond Sketch: Accurate Per-flow Measurement for Big Streaming Data
    Yang, Tong
    Gao, Siang
    Sun, Zhouyi
    Wang, Yufei
    Shen, Yulong
    Li, Xiaoming
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2019, 30 (12) : 2650 - 2662
  • [5] AGC Sketch: An effective and accurate per-flow measurement to adapt flow size distribution
    Li, Zhuo
    Liu, Ziyu
    Liu, Jindian
    Zhang, Yu
    Liang, Teng
    Liu, Kaihua
    COMPUTER COMMUNICATIONS, 2024, 221 : 120 - 130
  • [6] An Efficient Adaptive Denoising Sketch for Per-flow Traffic Measurement
    Lou, Chen
    Sun, Yu-E
    Huang, He
    Du, Yang
    Chen, Shigang
    Gao, Guoju
    Xu, Hongli
    2022 IEEE INTERNATIONAL PERFORMANCE, COMPUTING, AND COMMUNICATIONS CONFERENCE, IPCCC, 2022,
  • [7] TailoredSketch: A Fast and Adaptive Sketch for Efficient Per-Flow Size Measurement
    Gao, Guoju
    Qian, Zhaorong
    Huang, He
    Sun, Yu-E
    Du, Yang
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2025, 12 (01): : 505 - 517
  • [8] Priority-Aware Per-flow Measurement using Cuckoo Sketch
    Yan, Yibo
    Chen, Cheng
    Lin, Huiping
    Ruas, Olivier
    Wang, Tengjiao
    Yang, Tong
    2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), 2020, : 622 - 624
  • [9] Per-Flow Size Measurement by Combining Sketch and Flow Table in Software-Defined Networks
    Qian, Zhaorong
    Gao, Guoju
    Du, Yang
    2022 IEEE INTL CONF ON PARALLEL & DISTRIBUTED PROCESSING WITH APPLICATIONS, BIG DATA & CLOUD COMPUTING, SUSTAINABLE COMPUTING & COMMUNICATIONS, SOCIAL COMPUTING & NETWORKING, ISPA/BDCLOUD/SOCIALCOM/SUSTAINCOM, 2022, : 644 - 651
  • [10] Augmented Sketch: Faster and More Accurate Stream Processing
    Roy, Pratanu
    Khan, Arijit
    Alonso, Gustavo
    SIGMOD'16: PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON MANAGEMENT OF DATA, 2016, : 1449 - 1463