activity
20162022
most citedConstant Time Updates in Hierarchical Heavy Hitters

149 citations · 160 across the 11 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2021

SALSA: Self-Adjusting Lean Streaming Analytics

Ran Ben Basat, Gil Einziger, Michael Mitzenmacher +1

Counters are the fundamental building block of many data sketching schemes, which hash items to a small number of counters and account for collisions to provide good approximations…

cs.DS2020

Faster and More Accurate Measurement through Additive-Error Counters

Ran Ben Basat, Gil Einziger, Michael Mitzenmacher +1

Counters are a fundamental building block for networking applications such as load balancing, traffic engineering, and intrusion detection, which require estimating flow sizes and…

cs.DS2017

Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free

Eran Assaf, Ran Ben Basat, Gil Einziger +1

For many networking applications, recent data is more significant than older data, motivating the need for sliding window solutions. Various capabilities, such as DDoS detection an…

cs.DS2017

Fast Flow Volume Estimation

Ran Ben Basat, Gil Einziger, Roy Friedman

The increasing popularity of jumbo frames means growing variance in the size of packets transmitted in modern networks. Consequently, network monitoring tools must maintain explici…

cs.DS2017149 cited

Constant Time Updates in Hierarchical Heavy Hitters

Ran Ben Basat, Gil Einziger, Roy Friedman +2

Monitoring tasks, such as anomaly and DDoS detection, require identifying frequent flow aggregates based on common IP prefixes. These are known as \emph{hierarchical heavy hitters}…

cs.DS2016

Efficient Summing over Sliding Windows

Ran Ben Basat, Gil Einziger, Roy Friedman +1

This paper considers the problem of maintaining statistic aggregates over the last W elements of a data stream. First, the problem of counting the number of 1's in the last W bits…