Low-Latency and Low-Overhead Path Planning for In-band Network-Wide Telemetry

Authors: Penghui Zhang, Hua Zhang, Jun-Bo Wang, Cheng Zeng, Zijian Cao

Abstract:

With the development of software-defined networks and programmable data planes, in-band network telemetry (INT) has become an emerging technology in communications because it can get accurate and real-time network information. However, due to the expansion of the network scale, existing telemetry systems, to the best of the authors’ knowledge, have difficulty in meeting the common requirements of low overhead, low latency and full coverage for traffic measurement. This paper proposes a network-wide telemetry system with a low-latency low-overhead path planning (INT-LLPP). This paper builds a mathematical model to analyze the telemetry overhead and latency of INT systems. Then, we adopt a greedy-based path planning algorithm to reduce the overhead and latency of the network telemetry with the full network coverage. The simulation results show that network-wide telemetry is achieved and the telemetry overhead can be reduced significantly compared with existing INT systems. INT-LLPP can control the system latency to get real-time network information.

Keywords: Network telemetry, network monitoring, path planning, low latency.

References:

[1] T. Yang, J. Jiang, P. Liu, Q. Huang, and S. Uhlig, “Elastic sketch: adaptive and fast network-wide measurements,” in the 2018 Conference of the ACM Special Interest Group, 2018.
[2] M. Yu, “Network telemetry: Towards a top-down approach,” ACM SIGCOMM Computer Communication Review, vol. 49, no. 1, pp. 11–17, 2019.
[3] T. Barbette, C. Soldani, and L. Mathy, “Fast Userspace Packet Processing,” in 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), 2015.
[4] Y. Lin, Y. Zhou, Z. Liu, K. Liu, Y. Wang, M. Xu, J. Bi, Y. Liu, and J. Wu, “NetView: Towards on-demand network-wide telemetry in the data center,” Computer Networks, vol. 180, p. 107386, 2020.
[Online]. Available: https://www.sciencedirect.com/science/article/pii/ S1389128620302449
[5] Y. Li, M. Alizadeh, M. Yu, R. Miao, and F. Kelly, “HPCC: high precision congestion control,” in the ACM Special Interest Group, 2019.
[6] T. Pan, E. Song, Z. Bian, X. Lin, X. Peng, J. Zhang, T. Huang, B. Liu, and Y. Liu, “INT-path: Towards Optimal Path Planning for In-band Network-Wide Telemetry,” in IEEE INFOCOM 2019 - IEEE Conference on Computer Communications, 2019, pp. 487–495.
[7] R. B. Basat, S. Ramanathan, Y. Li, G. Antichi, and M. Mitzenmacher, “PINT: Probabilistic In-band Network Telemetry,” ACM, 2020.
[8] E. Song, T. Pan, C. Jia, W. Cao, J. Zhang, T. Huang, and Y. Liu, “INT-label: Lightweight In-Band Network-Wide Telemetry via Interval-Based Distributed Labelling,” in IEEE INFOCOM 2021 - IEEE Conference on Computer Communications. IEEE Press, 2021, p. 1–10.
[Online]. Available: https://doi.org/10.1109/INFOCOM42981. 2021.9488799
[9] N. Katta, M. Hira, C. Kim, A. Sivaraman, and J. Rexford, “Hula: Scalable load balancing using programmable data planes,” in ACM, 2016.
[10] Z. Liu, J. Bi, Y. Zhou, Y. Wang, and Y. Lin, “Netvision: Towards network telemetry as a service,” in 2018 IEEE 26th International Conference on Network Protocols (ICNP), 2018, pp. 247–248.
[11] D. Bhamare, A. Kassler, J. Vestin, M. A. Khoshkholghi, and J. Taheri, “Intopt: In-band network telemetry optimization for nfv service chain monitoring,” in ICC 2019 - 2019 IEEE International Conference on Communications (ICC), 2019, pp. 1–7.
[12] Sunshine and A. Carl, “Source routing in computer networks,” ACM SIGCOMM Computer Communication Review, vol. 7, no. 1, pp. 29–33, 1977.
[13] Cole, Schlesinger, David, Walker, Amin, Vahdat, Dan, Daly, George, and Varghesex, “P4: Programming protocol-independent packet processors,” Computer Communication Review: A Quarterly Publication of the Special Interest Group on Data Communication, vol. 44, no. 3, pp. 87–95, 2014.
[14] A. El-mekkawi, X. Hesselbach, and J. R. Piney, “Evaluating the impact of delay constraints in network services for intelligent network slicing based on skm model,” Journal of Communications and Networks, vol. 23, no. 4, pp. 281–298, 2021.