INT-path: Towards Optimal Path Planning for In-band Network-Wide Telemetry
Authors:
- 1 April 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 487-495
Abstract
With the ever-increasing complexity of networks, fine-grained network monitoring enables better network reliability and timely feedback control. The In-band Network Telemetry (INT) allows cost-effective network monitoring by encapsulating device-internal states into probe packets. However, INT only specifies an underlying device-level primitive while how to achieve network-wide traffic monitoring remains undefined. In this work, we propose INT-path, a network-wide telemetry framework, by decoupling the system into a routing mechanism and a routing path generation policy. Specifically, we embed source routing into INT probes to allow specifying the route the probe packet takes through the network. Above the mechanism, we develop an Euler trail-based path planning policy to generate non-overlapped INT paths that cover the entire network with a minimum path number. Besides, an exhaustive analysis of algorithm's run-time complexity is also provided. INT-path can “encode” the network-wide traffic status into a series of “bitmap images”, transforming network troubleshooting into pattern recognition problems. INT-path is very suitable for deployment in data center networks thanks to their symmetric network topologies.Keywords
This publication has 9 references indexed in Scilit:
- Knowledge-Defined NetworkingACM SIGCOMM Computer Communication Review, 2017
- Towards ONOS-based SDN monitoring using in-band network telemetry2017
- PingmeshACM SIGCOMM Computer Communication Review, 2015
- P4ACM SIGCOMM Computer Communication Review, 2014
- Undirected single-source shortest paths with positive integer weights in linear timeJournal of the ACM, 1999
- Simple Network Management Protocol (SNMP)1990
- Source routing in computer networksACM SIGCOMM Computer Communication Review, 1977
- Graph Theory with Applications1976
- Ueber die Möglichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahrenMathematische Annalen, 1873