Single Update Sketch with Variable Counter Structure

Author:

Melissourgos Dimitrios1,Wang Haibo2,Chen Shigang3,Ma Chaoyi3,Chen Shiping4

Affiliation:

1. Grand Valley State University, Allendale, MI, USA

2. University of Kentucky, Lexington, KY, USA

3. University of Florida, Gainesville, FL, USA

4. University of Shanghai for Science and Technology, Shanghai, China

Abstract

Per-flow size measurement is key to many streaming applications and management systems, particularly in high-speed networks. Performing such measurement on the data plane of a network device at the line rate requires on-chip memory and computing resources that are shared by other key network functions. It leads to the need for very compact and fast data structures, called sketches, which trade off space for accuracy. Such a need also arises in other application context for extremely large data sets. The goal of sketch design is two-fold: to measure flow size as accurately as possible and to do so as efficiently as possible (for low overhead and thus high processing throughput). The existing sketches can be broadly categorized to multi-update sketches and single update sketches. The former are more accurate but carry larger overhead. The latter incur small overhead but their accuracy is poor. This paper proposes a Single update Sketch with a Variable counter Structure (SSVS), a new sketch design which is several times faster than the existing multi-update sketches with comparable accuracy, and is several times more accurate than the existing single update sketches with comparable overhead. The new sketch design embodies several technical contributions that integrate the enabling properties from both multi-update sketches and single update sketches in a novel structure that effectively controls the measurement error with minimum processing overhead.

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference59 articles.

1. Lada A Adamic and Bernardo A Huberman . 2000. Power-law Distribution of the World Wide Web. science 287, 5461 ( 2000 ), 2115--2115. Lada A Adamic and Bernardo A Huberman. 2000. Power-law Distribution of the World Wide Web. science 287, 5461 (2000), 2115--2115.

2. Ran Ben Basat , Xiaoqi Chen , Gil Einziger , Shir Landau Feibish , Danny Raz , and Minlan Yu . 2020 . Routing Oblivious Measurement Analytics. In 2020 IFIP Networking Conference (Networking). IEEE, 449--457 . Ran Ben Basat, Xiaoqi Chen, Gil Einziger, Shir Landau Feibish, Danny Raz, and Minlan Yu. 2020. Routing Oblivious Measurement Analytics. In 2020 IFIP Networking Conference (Networking). IEEE, 449--457.

3. Ran Ben Basat , Gil Einziger , Michael Mitzenmacher , and Shay Vargaftik . 2020 . Faster and More Accurate Measurement Through Additive-error Counters. In IEEE INFOCOM 2020-IEEE Conference on Computer Communications. IEEE, 1251--1260 . Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, and Shay Vargaftik. 2020. Faster and More Accurate Measurement Through Additive-error Counters. In IEEE INFOCOM 2020-IEEE Conference on Computer Communications. IEEE, 1251--1260.

4. Ran Ben Basat , Gil Einziger , Michael Mitzenmacher , and Shay Vargaftik . 2021 . SALSA: Self-adjusting Lean Streaming Analytics. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 864--875 . Ran Ben Basat, Gil Einziger, Michael Mitzenmacher, and Shay Vargaftik. 2021. SALSA: Self-adjusting Lean Streaming Analytics. In 2021 IEEE 37th International Conference on Data Engineering (ICDE). IEEE, 864--875.

5. Routing-Oblivious Network-Wide Measurements

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

1. Single Update Sketch with Variable Counter Structure;Proceedings of the VLDB Endowment;2023-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3