English

Low Complexity Approaches for End-to-End Latency Prediction

Artificial Intelligence 2023-02-02 v1 Signal Processing

Abstract

Software Defined Networks have opened the door to statistical and AI-based techniques to improve efficiency of networking. Especially to ensure a certain Quality of Service (QoS) for specific applications by routing packets with awareness on content nature (VoIP, video, files, etc.) and its needs (latency, bandwidth, etc.) to use efficiently resources of a network. Predicting various Key Performance Indicators (KPIs) at any level may handle such problems while preserving network bandwidth. The question addressed in this work is the design of efficient and low-cost algorithms for KPI prediction, implementable at the local level. We focus on end-to-end latency prediction, for which we illustrate our approaches and results on a public dataset from the recent international challenge on GNN [1]. We propose several low complexity, locally implementable approaches, achieving significantly lower wall time both for training and inference, with marginally worse prediction accuracy compared to state-of-the-art global GNN solutions.

Keywords

Cite

@article{arxiv.2302.00004,
  title  = {Low Complexity Approaches for End-to-End Latency Prediction},
  author = {Pierre Larrenie and Jean-François Bercher and Olivier Venard and Iyad Lahsen-Cherif},
  journal= {arXiv preprint arXiv:2302.00004},
  year   = {2023}
}

Comments

arXiv admin note: substantial text overlap with arXiv:2301.13536

R2 v1 2026-06-28T08:28:24.063Z