9 citations · 10 across the 3 of their papers we have counts for
3 papers
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★ 9 cited
Optimal Elephant Flow Detection
Ran Ben Basat, Gil Einziger, Roy Friedman +1
Monitoring the traffic volumes of elephant flows, including the total byte count per flow, is a fundamental capability for online network measurements. We present an asymptotically…
cs.DS2016★ 1 cited
Randomized Admission Policy for Efficient Top-k and Frequency Estimation
Ran Ben Basat, Gil Einziger, Roy Friedman +1
Network management protocols often require timely and meaningful insight about per flow network traffic. This paper introduces Randomized Admission Policy (RAP) - a novel algorithm…