Source code of "Network-Wide Routing-Oblivious Heavy Hitters" paper by Ran Ben Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, and Danny Raz (ACM/IEEE ANCS 2018).
-
Updated
Dec 17, 2018 - C++
Source code of "Network-Wide Routing-Oblivious Heavy Hitters" paper by Ran Ben Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, and Danny Raz (ACM/IEEE ANCS 2018).
PoC (Proof of Concept) caching optimization algorithm for graphical tree environment, written entirely in pure C++.
Implementation for - Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches
My Thesis on the data structure Count-Min Sketch and it's applications.
Reinforcement Learning (RL)-based routing algorithm for SDN networks created from scratch using Python.
Comparing the Double Space Saving DS to the Heavy Keeper DS for the real world input streams
A novel approach based on Random Forests that quickly and accurately identifies elephant flows in programmable Data Planes.
Efficient Flow Recording with InheritSketch on Programmable Switches (ICDCS2023)
P4 implementation of CMSIS, a heavy-hitter detection algorithm for programmable switches.
Implementation of streaming algorithms (Misra-Gries & Lossy Counting) for getting frequent items from data streams.
Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
Code for "PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries"
Heavy-Hitter detection in P4 switch ASIC using Inter-Packet Gap
[NeurIPS'23] H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models.
Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics
Sliding-window and regular top-K sketches, based on HeavyKeeper
Add a description, image, and links to the heavy-hitters topic page so that developers can more easily learn about it.
To associate your repository with the heavy-hitters topic, visit your repo's landing page and select "manage topics."