{"title":"DINT: A Dynamic Algorithm for In-band Network Telemetry","authors":"Henrique B. Brum, C. R. P. D. Santos, T. Ferreto","doi":"10.5753/sbrc.2023.531","DOIUrl":null,"url":null,"abstract":"Network monitoring is fundamental for the correct and expected functioning of today’s large computer networks. In-band Network Telemetry (INT) has become one of the main tools for collecting network information in recent years. By piggybacking information using business packets, INT can deliver real-time network statistics to monitoring engines. However, INT’s fine granularity comes with a high network overhead cost. This paper focuses on balancing this trade-off between accurate monitoring and high telemetry overhead. To achieve it, we propose DINT, a Dynamic INT algorithm capable of adapting to different traffic patterns while keeping an accurate view of the network and reducing flooding it with redundant telemetry data. In our experiments, DINT presented higher adaptability compared to other techniques, providing a more accurate view of the network while requiring fewer telemetry data.","PeriodicalId":254689,"journal":{"name":"Anais do XLI Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos (SBRC 2023)","volume":"2019 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do XLI Simpósio Brasileiro de Redes de Computadores e Sistemas Distribuídos (SBRC 2023)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5753/sbrc.2023.531","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Network monitoring is fundamental for the correct and expected functioning of today’s large computer networks. In-band Network Telemetry (INT) has become one of the main tools for collecting network information in recent years. By piggybacking information using business packets, INT can deliver real-time network statistics to monitoring engines. However, INT’s fine granularity comes with a high network overhead cost. This paper focuses on balancing this trade-off between accurate monitoring and high telemetry overhead. To achieve it, we propose DINT, a Dynamic INT algorithm capable of adapting to different traffic patterns while keeping an accurate view of the network and reducing flooding it with redundant telemetry data. In our experiments, DINT presented higher adaptability compared to other techniques, providing a more accurate view of the network while requiring fewer telemetry data.