Name
Title | ||
|---|---|---|
Avoiding Flow Size Overestimation in Count-Min Sketch With Bloom Filter Constructions |
Abstract | ||
|---|---|---|
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... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TNSM.2021.3068604 | IEEE Transactions on Network and Service Management |
Keywords | DocType | Volume |
Estimation,Size measurement,Hash functions,Memory management,Task analysis,Probabilistic logic,Complexity theory | Journal | 18 |
Issue | ISSN | Citations |
3 | 1932-4537 | 1 |
PageRank | References | Authors |
0.35 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ori Rottenstreich | 1 | 9 | 7.31 |
| Pedro Reviriego | 2 | 527 | 75.56 |
| ely porat | 3 | 1007 | 79.16 |
| S. Muthukrishnan | 4 | 8025 | 734.98 |