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

Rana Shahout, Dolev Adas, Roy Friedman

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationSYSTOR 2021 - Proceedings of the 14th ACM International Conference on Systems and Storage
ISBN (Electronic)9781450383981
DOIs
StatePublished - 14 Jun 2021
Event14th ACM International Conference on Systems and Storage, SYSTOR 2021 - Virtual, Online, Israel
Duration: 14 Jun 202116 Jun 2021

Publication series

NameSYSTOR 2021 - Proceedings of the 14th ACM International Conference on Systems and Storage

Conference

Conference14th ACM International Conference on Systems and Storage, SYSTOR 2021
Country/TerritoryIsrael
CityVirtual, Online
Period14/06/2116/06/21

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Hardware and Architecture
  • Software

Cite this