Routing-Oblivious Network-Wide Measurements

Ran Ben-Basat, Gil Einziger, Shir Landau Feibish, Jalil Moraney, Bilal Tayh, Danny Raz

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

The recent introduction of SDN allows deploying new centralized network algorithms that dramatically improve network operations. In such algorithms, the centralized controller obtains a network-wide view by merging measurement data from Network Measurement Points (NMPs). A fundamental challenge is that several NMPs may count the same packet, reducing the accuracy of the measurement. Existing solutions circumvent this problem by assuming that each packet traverses a single NMP or that the routing is fixed and known. This work suggests novel algorithms for three fundamental network-wide measurement problems without making any assumptions on the topology and routing and without modifying the underlying traffic. Specifically, this work introduces two algorithms for estimating the number of (distinct) packets or byte volume in the measurement, estimating per-flow packet and byte counts, and finding the heavy hitter flows. Our work includes formal accuracy guarantees and an extensive evaluation consisting of the realistic fat-tree topology and three real network traces. Our evaluation shows that our algorithms outperform existing works and provide accurate measurements within reasonable space parameters.

Original languageEnglish
Pages (from-to)2386-2398
Number of pages13
JournalIEEE/ACM Transactions on Networking
Volume29
Issue number6
DOIs
StatePublished - 1 Dec 2021

Keywords

  • Communication technology
  • Internet
  • communication systems
  • computer networks

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Routing-Oblivious Network-Wide Measurements'. Together they form a unique fingerprint.

Cite this