NODE: Network Wide Top-K Flows in the Data Plane
Eitan Stein, Lior Zeno, Shir Landau Feibish

TL;DR
NODE is a data plane algorithm enabling network-wide top-k flow detection without control plane communication, achieving high accuracy and low memory usage in real and synthetic traffic scenarios.
Contribution
The paper introduces NODE, a novel data plane solution for global top-k flow detection that eliminates the need for centralized control and aggregation.
Findings
Detects global top-k flows with over 95% recall.
Operates entirely within the data plane, reducing latency.
Uses less than 300KB memory per switch.
Abstract
Monitoring network traffic is crucial for most network tasks, such as, identifying and blocking attacks, pinpointing failures and engineering and rerouting heavy traffic to maintain high throughput. One important metric when monitoring the traffic is finding the top-k heavy flows, that is the k heaviest flows in the traffic. Programmable networks allow performing advanced network analysis right in the data plane. In recent years, various solutions have been proposed for efficiently finding the top-k heavy flows within a single switch. However, at times we may need to find the global top-k flows. Existing solutions for global top-k detection use a centralized controller that collects and aggregates the measurements performed in each of the switches. Yet, the process of sending information to the control plane and then having the controller send back the information to the switches can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
