Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3456727.3463826acmconferencesArticle/Chapter ViewAbstractPublication PagessystorConference Proceedingsconference-collections
research-article

CELL: counter estimation for per-flow traffic over sliding windows

Published: 14 June 2021 Publication History

Abstract

Estimators reduce the memory footprint of maintaining network statistics, while keeping the estimation error of each flow proportional to its size. This is unlike sketches and other approximate algorithms that only guarantee an error proportional to the entire stream size. In this work we present the CELL algorithm that combines estimators with efficient flow representation to obtain superior memory reduction compared to the state of the art.
We also extend CELL to the sliding window model, which priorities recent data over old one, by presenting two variants named RAND-CELL and SHIFT-CELL.

References

[1]
Eran Assaf, Ran Ben Basat, Gil Einziger, and Roy Friedman. Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free. In IEEE Conference on Computer Communications (INFOCOM), pages 2204--2212, 2018.
[2]
Robert Morris. Counting Large Numbers of Events in Small Registers. Commun. ACM, 21(10):840--842, 1978.

Cited By

View all
  • (2023)A survey on sliding window sketch for network measurementComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2023.109696226:COnline publication date: 1-May-2023

Index Terms

  1. CELL: counter estimation for per-flow traffic over sliding windows

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SYSTOR '21: Proceedings of the 14th ACM International Conference on Systems and Storage
    June 2021
    226 pages
    ISBN:9781450383981
    DOI:10.1145/3456727
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

    Sponsors

    In-Cooperation

    • Technion: Israel Institute of Technology
    • USENIX Assoc: USENIX Assoc

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 14 June 2021

    Permissions

    Request permissions for this article.

    Check for updates

    Qualifiers

    • Research-article

    Conference

    SYSTOR '21
    Sponsor:

    Acceptance Rates

    SYSTOR '21 Paper Acceptance Rate 18 of 63 submissions, 29%;
    Overall Acceptance Rate 108 of 323 submissions, 33%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)4
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 20 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)A survey on sliding window sketch for network measurementComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2023.109696226:COnline publication date: 1-May-2023

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media