Routing-Oblivious Network-Wide Measurements

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

פרסום מחקרי: פרסום בכתב עתמאמרביקורת עמיתים


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.

שפה מקוריתאנגלית
עמודים (מ-עד)2386-2398
מספר עמודים13
כתב עתIEEE/ACM Transactions on Networking
מספר גיליון6
מזהי עצם דיגיטלי (DOIs)
סטטוס פרסוםפורסם - 1 דצמ׳ 2021

הערה ביבליוגרפית

Publisher Copyright:
© 2021 IEEE.

טביעת אצבע

להלן מוצגים תחומי המחקר של הפרסום 'Routing-Oblivious Network-Wide Measurements'. יחד הם יוצרים טביעת אצבע ייחודית.

פורמט ציטוט ביבליוגרפי