Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions

Ori Rottenstreich,Pedro Reviriego,Ely Porat,S. Muthukrishnan

IEEE Transactions on Network and Service Management（2021）

引用 7|浏览37

暂无评分

摘要

The Count-Min sketch is the most popular data structure for flow size estimation, a basic measurement task required in many networks. Typically the number of potential flows is large, eliminating the possibility to maintain a counter per flow within memory of high access rate. The Count-Min sketch is probabilistic and relies on mapping each flow to multiple counters through hashing. This implies p...

查看译文

关键词

Estimation,Size measurement,Hash functions,Memory management,Task analysis,Probabilistic logic,Complexity theory

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要