149 citations · 149 across the 3 of their papers we have counts for
5 papers
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…
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…
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}…
ICE Buckets: Improved Counter Estimation for Network Measurement
Gil Einziger, Benny Fellman, Roy Friedman +1
Measurement capabilities are essential for a variety of network applications, such as load balancing, routing, fairness and intrusion detection. These capabilities require large co…
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…