mortzdk / heavy-hitters
This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations of approximate heavy hitters algorithms.
☆14Updated 8 years ago
Alternatives and similar repositories for heavy-hitters:
Users that are interested in heavy-hitters are comparing it to the libraries listed below
- This repository contains the open source of the Pyramid sketch framework (accepted by VLDB 2017 and then submitted to ToN).☆19Updated 6 years ago
- Implementation of the ""Constant Time Updates in Hierarchical Heavy Hitters" paper, ACM SIGCOMM 2017☆20Updated 6 years ago
- Implementation based on OSDI paper☆19Updated 6 years ago
- Cheetah is a system that optimizes queries using programmable switches.☆19Updated 4 years ago
- This is an official GitHub repository for the paper, "Towards timeout-less transport in commodity datacenter networks.".☆15Updated 3 years ago
- This repository contains the open source related to Cold Filter meta-framework (accepted by SIGMOD2018).☆31Updated 6 years ago
- The code for both the framework and experiments from the NSDI '19 paper "Loom: Flexible and Efficient NIC Packet Scheduling"☆30Updated 5 years ago
- DEPRECATED. see github.com/ccp-project/portus☆10Updated 6 years ago
- ☆31Updated 5 years ago
- ☆25Updated 6 years ago
- ☆33Updated last year
- ☆17Updated 6 years ago
- ☆25Updated 3 years ago
- This is the p4 code for LossRadar (CoNext' 16) data plane☆13Updated 8 years ago
- ☆15Updated last year
- ☆20Updated 3 years ago
- NS-2 code for simulating results in Universal Packet Scheduling☆9Updated 5 years ago
- Blink: Fast Connectivity Recovery Entirely in the Data Plane☆25Updated 3 years ago
- NetChain in P4☆17Updated 4 years ago