Latest revision as of 19:36, 3 February 2021

Abstract

Counters are a fundamental building block for networking applications such as load balancing, traffic engineering, and intrusion detection, which require estimating flow sizes and identifying heavy hitter flows. Existing works suggest replacing counters with shorter multiplicative error \emph{estimators} that improve the accuracy by fitting more of them within a given space. However, such estimators impose a computational overhead that degrades the measurement throughput. Instead, we propose \emph{additive} error estimators, which are simpler, faster, and more accurate when used for network measurement. Our solution is rigorously analyzed and empirically evaluated against several other measurement algorithms on real Internet traces. For a given error target, we improve the speed of the uncompressed solutions by $5\times$-$30\times$, and the space by up to $4\times$. Compared with existing state-of-the-art estimators, our solution is $ 9\times$-$35\times$ faster while being considerably more accurate.

Comment: To appear in IEEE INFOCOM 2020

Original document

The different versions of the original document can be found in:

• http://arxiv.org/abs/2004.10332

• http://arxiv.org/pdf/2004.10332

• http://xplorestaging.ieee.org/ielx7/9146503/9155217/09155340.pdf?arnumber=9155340,

http://dx.doi.org/10.1109/infocom41043.2020.9155340

• https://dblp.uni-trier.de/db/conf/infocom/infocom2020.html#BasatEMV20,

https://ui.adsabs.harvard.edu/abs/2020arXiv200410332B/abstract,

https://ieeexplore.ieee.org/abstract/document/9155340,

https://academic.microsoft.com/#/detail/3017778882