ACM: Accuracy-Aware Collaborative Monitoring for Software-Defined Network-Wide Measurement

Software-defined measurement (SDM) is a simple and efficient way to deploy measurement tasks and collect measurement data. With SDM, it is convenient for operators to implement fine-grained network-wide measurements at the flow level, from which many important functions can benefit. The prior work provides mechanisms to distribute flows to monitors, such that each monitor can identify its non-overlapped subset of flows to measure, and a certain global performance criterion is optimized, such as load balance or flow coverage. Many applications of network management can benefit from a function that can find large flows efficiently, such as congestion control by dynamically scheduling large flows, caching of forwarding table entries, and network capacity planning. However, the current network-wide measurements neglect the diversity of different flows as they treat large flows and small flows equally. In this paper, we present a mechanism of accuracy-aware collaborative monitoring (ACM) to improve the measurement accuracies of large flows in network-wide measurements at the flow level. The structure of the sketch is an approximate counting algorithm, and a high-measurement accuracy can be achieved by merging the results from multiple monitors with sketches, which is termed as collaborative monitoring. The core idea of our method is to allocate more monitors to large flows and achieve the load balance to provide accuracy-aware monitoring. We modeled our problem as an integer–linear programming problem, which is NP-hard. Thus, we propose an approximation algorithm, named the improved longest processing time algorithm (iLPTA); we proved that its approximation ratio is (12+nl). We propose a two-stage online distribution algorithm (TODA). Moreover, we proved that its approximation ratio is (1+nl−1). The iLPTA is an offline approximation algorithm used to assign monitors for each flow, which prove the validity and feasibility of the core idea. The TODA is an online algorithm that attempts to achieve the load balance by selecting the monitor with the smallest load to a large flow. Our extensional experiment results verify the effectiveness of our proposed algorithms.

[1]  Zirui Liu,et al.  SketchINT: Empowering INT with TowerSketch for Per-flow Per-switch Measurement , 2021, 2021 IEEE 29th International Conference on Network Protocols (ICNP).

[2]  Wenfei Wu,et al.  DHS: Adaptive Memory Layout Organization of Sketch Slots for Fast and Accurate Data Stream Processing , 2021, KDD.

[3]  Chuck Yoo,et al.  Accurate and Efficient Monitoring for Virtualized SDN in Clouds , 2021 .

[4]  Steve Uhlig,et al.  HeavyKeeper: An Accurate Algorithm for Finding Top- $k$ Elephant Flows , 2019, IEEE/ACM Transactions on Networking.

[5]  Liusheng Huang,et al.  Lightweight Flow Distribution for Collaborative Traffic Measurement in Software Defined Networks , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[6]  Shahid Mumtaz,et al.  ReFeR: Resource Critical Flow Monitoring in Software-Defined Networks , 2018, 2018 IEEE Global Communications Conference (GLOBECOM).

[7]  Peng Liu,et al.  Elastic sketch: adaptive and fast network-wide measurements , 2018, SIGCOMM.

[8]  Minlan Yu,et al.  Cold Filter: A Meta-Framework for Faster and More Accurate Stream Processing , 2018, SIGMOD Conference.

[9]  Xin Jin,et al.  SketchVisor: Robust Network Measurement for Software Packet Processing , 2017, SIGCOMM.

[10]  Ori Rottenstreich,et al.  Optimal Rule Caching and Lossy Compression for Longest Prefix Matching , 2017, IEEE/ACM Transactions on Networking.

[11]  Vladimir Braverman,et al.  One Sketch to Rule Them All: Rethinking Network Flow Monitoring with UnivMon , 2016, SIGCOMM.

[12]  Nick McKeown,et al.  Programmable Packet Scheduling at Line Rate , 2016, SIGCOMM.

[13]  Gustavo Alonso,et al.  Augmented Sketch: Faster and More Accurate Stream Processing , 2016, SIGMOD Conference.

[14]  Minlan Yu,et al.  FlowRadar: A Better NetFlow for Data Centers , 2016, NSDI.

[15]  Minlan Yu,et al.  MOZART: Temporal Coordination of Measurement , 2016, SOSR.

[16]  Ramesh Govindan,et al.  SCREAM: sketch resource allocation for software-defined measurement , 2015, CoNEXT.

[17]  Chen-Nee Chuah,et al.  LEISURE: Load-Balanced Network-Wide Traffic Measurement and Monitor Placement , 2015, IEEE Transactions on Parallel and Distributed Systems.

[18]  Amin Vahdat,et al.  DREAM: dynamic resource allocation for software-defined measurement , 2015, SIGCOMM.

[19]  Xin Li,et al.  Distributed and collaborative traffic monitoring in software defined networks , 2014, HotSDN.

[20]  Minlan Yu,et al.  Software Defined Traffic Measurement with OpenSketch , 2013, NSDI.

[21]  Walter Willinger,et al.  cSamp: A System for Network-Wide Flow Monitoring , 2008, NSDI.

[22]  A. Gupta,et al.  Reversible Sketches: Enabling Monitoring and Analysis Over High-Speed Data Streams , 2007, IEEE/ACM Transactions on Networking.

[23]  Graham Cormode,et al.  An improved data stream summary: the count-min sketch and its applications , 2004, J. Algorithms.

[24]  Mark Crovella,et al.  Characterization of network-wide anomalies in traffic flows , 2004, IMC '04.

[25]  Anja Feldmann,et al.  Deriving traffic demands for operational IP networks: methodology and experience , 2001, TNET.

[26]  Wei Shih,et al.  A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem , 1979 .

[27]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[28]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.