A novel approach based on Random Forests that quickly and accurately identifies elephant flows in programmable Data Planes.
-
Updated
Oct 2, 2022 - P4
A novel approach based on Random Forests that quickly and accurately identifies elephant flows in programmable Data Planes.
Comparing the Double Space Saving DS to the Heavy Keeper DS for the real world input streams
Implementation of streaming algorithms (Misra-Gries & Lossy Counting) for getting frequent items from data streams.
PoC (Proof of Concept) caching optimization algorithm for graphical tree environment, written entirely in pure C++.
Efficient Flow Recording with InheritSketch on Programmable Switches (ICDCS2023)
Code for "PLASMA: Private, Lightweight Aggregated Statistics against Malicious Adversaries"
P4 implementation of CMSIS, a heavy-hitter detection algorithm for programmable switches.
My Thesis on the data structure Count-Min Sketch and it's applications.
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).
Reinforcement Learning (RL)-based routing algorithm for SDN networks created from scratch using Python.
Mastic: Private Weighted Heavy-Hitters and Attribute-Based Metrics
Heavy-Hitter detection in P4 switch ASIC using Inter-Packet Gap
Implementation for - Mitigating DNS random subdomain DDoS attacks by distinct heavy hitters sketches
Probabilistic data structures in python http://pyprobables.readthedocs.io/en/latest/index.html
[NeurIPS'23] H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Models.
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."