INT-Split: Based on Deployment Location Single-Path In-Band Network-Wide Telemetry

Network Telemetry is an essential aspect of network operation and maintenance automation, as well as network visual analysis. In-band network telemetry (INT) technology has become an essential component in large-scale data center operations in modern times. To achieve network-wide metric coverage, multiple INT paths are needed, with each INT instance covering a single monitoring path. This requires high-level orchestration. Generating the fewest paths possible and reducing overlapping links is accomplished through the use of an optimal path planning approach. While Euler trajectories have been used to solve general problems, they have limitations in deploying detectors to initiate and terminate INT paths in a production network. In our paper, we propose a single path planning algorithm called “INT-quick-search,“ which achieves comprehensive network telemetry coverage. Based on this, we introduce a path split algorithm that relies on detector start and stop locations. We conducted a complexity analysis of the algorithm and evaluated its performance on different scales and topologies. Our results demonstrate that the path planning time in telemetry is reduced by $ 53\%$ compared to INT-Path, and the detection path of a 14-pod Fat-Tree is calculated to be $41.13\mathrm{~ms}$.