pith. sign in

Load- sensitive routing of long-lived ip flows.ACM SIGCOMM Computer Communication Review, 29(4):215–226

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.NI 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

NODE: Network Wide Top-K Flows in the Data Plane

cs.NI · 2026-04-26 · unverdicted · novelty 6.0

NODE is a data-plane algorithm for network-wide top-k heavy flow detection achieving over 95% recall with under 300KB memory per switch on synthetic and real traces.

citing papers explorer

Showing 1 of 1 citing paper.

  • NODE: Network Wide Top-K Flows in the Data Plane cs.NI · 2026-04-26 · unverdicted · none · ref 25

    NODE is a data-plane algorithm for network-wide top-k heavy flow detection achieving over 95% recall with under 300KB memory per switch on synthetic and real traces.