Non-negative Matrix Factorization For Network Delay Matrix Completion - IMT Atlantique Access content directly
Conference Papers Year : 2022

Non-negative Matrix Factorization For Network Delay Matrix Completion

Abstract

Accurate estimation of delays in a network is crucial for its management. In real-world applications, it is not always possible to conduct on-demand measurements regularly on the overall network. Doing so is costly and time-consuming, and it is also possible that not all the equipments respond to the probes sent in the network. In this paper, we formulate the network delay prediction problem as a non-negative matrix factorization problem with piecewise constant coefficients of the approximate instantaneous representation of data. We choose this approach to utilize the strong spatial and temporal correlation that appear in network delay data. To solve this factorization problem, we consider two different algorithms: an alternating projected gradient algorithm and the NeNMF algorithm. We finally study the efficiency of our approach on two datasets. The first dataset is a synthetic dataset produced by a simulator that we have designed, and the second one is composed of RTT measurements from RIPE Atlas.
Fichier principal
Vignette du fichier
Non-negative Matrix Factorization For Network Delay Matrix Completion_AnNet2022.pdf (1.17 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03647577 , version 1 (20-04-2022)

Identifiers

Cite

Sanaa Ghandi, Alexandre Reiffers-Masson, Sandrine Vaton, Thierry Chonavel. Non-negative Matrix Factorization For Network Delay Matrix Completion. NOMS 2022: IEEE/IFIP Network Operations and Management Symposium - 7th IFIP/IEEE International Workshop on Analytics for Network and Service Management, Apr 2022, Budapest, Hungary. ⟨10.1109/NOMS54207.2022.9789871⟩. ⟨hal-03647577⟩
40 View
129 Download

Altmetric

Share

Gmail Facebook X LinkedIn More