2022 13th International Conference on Computing Communication and Networking Technologies (ICCCNT) 2022
DOI: 10.1109/icccnt54827.2022.9984543
|View full text |Cite
|
Sign up to set email alerts
|

Low Complexity Approaches for End-to-End Latency Prediction

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 address… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
1
1

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(7 citation statements)
references
References 13 publications
(23 reference statements)
0
6
0
Order By: Relevance
“…We will focus here on two very simple models, although other machine learning models have also been considered in [6]. Indeed, these two models lend themselves very easily to an adaptive formulation.…”
Section: Simple Machine-learning Approaches For Latency Predictionmentioning
confidence: 99%
See 4 more Smart Citations
“…We will focus here on two very simple models, although other machine learning models have also been considered in [6]. Indeed, these two models lend themselves very easily to an adaptive formulation.…”
Section: Simple Machine-learning Approaches For Latency Predictionmentioning
confidence: 99%
“…Several solutions were considered in [6] to define or choose the functions f n . Since we know that the Bernstein polynomials form a basis in the set of polynomial in the interval [0; 1]; and that the approximation of any continuous function on [0; 1[ by a Bernstein polynomial converges uniformly, we were led to these polynomials:…”
Section: Curve Regression By Bernstein Polynomialsmentioning
confidence: 99%
See 3 more Smart Citations