barrust / count-min-sketch
Count-Min Sketch Implementation in C
☆45Updated 11 months ago
Alternatives and similar repositories for count-min-sketch:
Users that are interested in count-min-sketch are comparing it to the libraries listed below
- Implementation of Count Min Sketch in C++☆56Updated 5 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
- ☆21Updated 7 years ago
- ☆35Updated 6 years ago
- Implementation of Stateless and Stateful Cheetah with TCP timestamps for the Tofino P4 target☆19Updated 3 years ago
- ☆15Updated last year
- ☆31Updated 5 years ago
- This repository contains the open source of the Pyramid sketch framework (accepted by VLDB 2017 and then submitted to ToN).☆19Updated 6 years ago
- Count-Min sketch-based approximate counting library☆45Updated 6 years ago
- ☆20Updated 5 years ago
- ☆20Updated 2 years ago
- ☆18Updated 4 years ago
- A user-level TCP/IP stack with NIC offload of stateful TCP operations☆69Updated 4 years ago
- This repository contains implementations of the Count-Min and Count-Median sketches. Furthermore it contains 6 different implementations …☆14Updated 8 years ago
- ☆27Updated 3 years ago
- ☆25Updated 6 years ago
- Lumina is a user-friendly tool to test the correctness and performance of hardware network stacks.☆19Updated last year
- 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
- A Network Function (NF) that re-orders packets per flow by buffering packets for a given time.☆23Updated 2 years ago
- Heavy hitter detection algorithm that is entirely in the dataplane☆25Updated 6 years ago
- Yet Another Packet Simulator (YAPS)☆40Updated 8 years ago
- NetLock: Fast, Centralized Lock Management Using Programmable Switches☆29Updated 4 years ago
- ☆14Updated 7 years ago
- Artifacts for the "Caching with Delayed Hits" paper as it appears in SIGCOMM '20.☆21Updated 3 years ago
- ☆31Updated 5 years ago
- The Programmable Data Plane: Reading List☆49Updated 4 years ago
- ☆10Updated last year
- ☆112Updated 2 years ago