Orchestrating In-Band Data Plane Telemetry With Machine Learning

In-band network telemetry (INT) is an emerging network monitoring paradigm. By collecting low-level telemetry items in real time, INT can substantially enhance network-wide visibility - allowing, for example, timely detection problems such as micro-burst. Recent studies have focused on (i) developing INT mechanisms to increase network-wide visibility; and (ii) to design new monitoring solutions. However, little has been done to coordinate the process of collecting telemetry items in this new paradigm. This is particularly challenging because depending on which network telemetry items are collected, it might degrade network-wide visibility in terms of consistency/freshness. In this letter, we theoretically formalize the In-band Network Telemetry Orchestration Plan Problem and propose a machine learning based orchestration model. Results show that our approach outperforms state-of-the-art heuristics by up a factor of 8x with respect to the number of network anomalies identified, for instance.

[1]  Paramvir Bahl,et al.  Real-Time Video Analytics: The Killer App for Edge Computing , 2017, Computer.

[2]  Yu Zhou,et al.  NetVision: Towards Network Telemetry as a Service , 2018, 2018 IEEE 26th International Conference on Network Protocols (ICNP).

[3]  Behnaz Arzani,et al.  007: Democratically Finding The Cause of Packet Drops , 2018, NSDI.

[4]  Ben Y. Zhao,et al.  Packet-Level Telemetry in Large Datacenter Networks , 2015, SIGCOMM.

[5]  Myungjin Lee,et al.  Simplifying Datacenter Network Debugging with PathDump , 2016, OSDI.

[6]  Luciano Paschoal Gaspary,et al.  An optimization-based approach for efficient network monitoring using in-band network telemetry , 2019, Journal of Internet Services and Applications.

[7]  George Varghese,et al.  P4: programming protocol-independent packet processors , 2013, CCRV.

[8]  Ibrahim Matta,et al.  BRITE: an approach to universal topology generation , 2001, MASCOTS 2001, Proceedings Ninth International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Myungjin Lee,et al.  Distributed Network Monitoring and Debugging with SwitchPointer , 2018, NSDI.

[10]  Meena Mahajan,et al.  The planar k-means problem is NP-hard , 2012, Theor. Comput. Sci..

[11]  Bin Liu,et al.  INT-path: Towards Optimal Path Planning for In-band Network-Wide Telemetry , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Maxim Sviridenko,et al.  An Algorithm for Online K-Means Clustering , 2014, ALENEX.

[14]  Albert,et al.  Topology of evolving networks: local events and universality , 2000, Physical review letters.

[15]  Filip De Turck,et al.  Predicting the performance of virtual reality video streaming in mobile networks , 2018, MMSys.

[16]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..