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
مستوى الصوت29
رقم الإصدار6
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 1 ديسمبر 2021

ملاحظة ببليوغرافية

Publisher Copyright:
© 2021 IEEE.


أدرس بدقة موضوعات البحث “Routing-Oblivious Network-Wide Measurements'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا