Routing-Oblivious Network-Wide Measurements

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.

Automated summary

Recent introduction of SDN enables the deployment of new centralized network algorithms that significantly enhance network operations. This research proposes novel algorithms for fundamental network-wide measurement problems without making assumptions on the topology and routing, or modifying the underlying traffic. An extensive evaluation on realistic network topologies and traces demonstrates that the proposed algorithms outperform existing works in terms of accuracy within reasonable space constraints.