activity
20162019
most citedConstant Time Updates in Hierarchical Heavy Hitters

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

collaborators

8 papers

cs.DC2019

A Generic Efficient Biased Optimizer for Consensus Protocols

Yehonatan Buchnik, Roy Friedman

Consensus is one of the most fundamental distributed computing problems. In particular, it serves as a building block in many replication based fault-tolerant systems and in partic…

cs.DC2019

FireLedger: A High Throughput Blockchain Consensus Protocol

Yehonatan Buchnik, Roy Friedman

Blockchains are distributed secure ledgers to which transactions are issued continuously and each block of transactions is tightly coupled to its predecessors. Permissioned blockch…

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.NI2016

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…