Analyzing Count Min Sketch with Conservative Updates - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Computer Networks Année : 2022

Analyzing Count Min Sketch with Conservative Updates

Résumé

Count-Min Sketch with Conservative Updates (CMS-CU) is a popular algorithm to approximately count items’ appearances in a data stream. Despite CMS-CU’s widespread adoption, the theoretical analysis of its performance is still wanting because of its inherent difficulty. In this paper, we propose a novel approach to study CMS-CU and derive new upper bounds on both the expected value and the CCDF of the estimation error under an i.i.d. request process. Our formulas can be successfully employed to derive improved estimates for the precision of heavy-hitter detection methods and improved configuration rules for CMS-CU. The bounds are evaluated both on synthetic and real traces.
Fichier sous embargo
Fichier sous embargo
0 4 26
Année Mois Jours
Avant la publication
dimanche 15 septembre 2024
Fichier sous embargo
dimanche 15 septembre 2024
Connectez-vous pour demander l'accès au fichier

Dates et versions

hal-03764212 , version 1 (15-09-2022)

Identifiants

Citer

Younes Ben Mazziane, Sara Alouf, Giovanni Neglia. Analyzing Count Min Sketch with Conservative Updates. Computer Networks, 2022, 217, pp.109315. ⟨10.1016/j.comnet.2022.109315⟩. ⟨hal-03764212⟩
69 Consultations
4 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More