Current IP-based networks support a wide range of delay-sensitive applications such as live video streaming of network gaming. Providing an adequate quality of experience to these applications is of paramount importance for a network provider. The offered services are often regulated by tight Service Level Agreements (SLAs) that needs to be continuously monitored. Since the first step to guarantee a metric is to measure it, delay measurement becomes a fundamental operation for a network provider. In many cases, the operator needs to measure the delay on all network links. We refer to the collection of all link delays as the Link Delay Vector (LDV). Typical solutions to collect the LDV impose a substantial overhead on the network. In this paper, we propose a solution to measure the LDV in real-time with a low-overhead approach. In particular, we inject some flows into the network and infer the LDV based on the delay of those flows. To this end, the monitoring flows and their paths should be selected minimizing the network monitoring overhead. In this respect, the challenging issue is to select a proper combination of flows such that by knowing their delay it is possible to solve a set of linear equations and obtain a unique LDV. This combination of monitoring flows should be optimal according to some criteria and should meet some feasibility constraints. We first propose a mathematical formulation to select the optimal combination of flows, in form of an Integer Linear Programming (ILP) problem. Then we develop a heuristic algorithm to overcome the high computational complexity of existing ILP solvers. As a further step, we propose a meta-heuristic algorithm to solve the above-mentioned equations and infer the LDV. The challenging part of this step is the volatility of link delays. The proposed solution is evaluated over real-world emulated network topologies using the Mininet network emulator. Emulation results show the accuracy of the proposed solution with a negligible networking overhead in a real-time manner.

Tajiki, M.m., Petroudi, S., Salsano, S., Uhlig, S., Castro, I. (2021). Optimal Estimation of Link Delays Based on End-to-End Active Measurements. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 18(4), 4730-4743 [10.1109/TNSM.2021.3106109].

Optimal Estimation of Link Delays Based on End-to-End Active Measurements

Salsano S.;
2021-08-01

Abstract

Current IP-based networks support a wide range of delay-sensitive applications such as live video streaming of network gaming. Providing an adequate quality of experience to these applications is of paramount importance for a network provider. The offered services are often regulated by tight Service Level Agreements (SLAs) that needs to be continuously monitored. Since the first step to guarantee a metric is to measure it, delay measurement becomes a fundamental operation for a network provider. In many cases, the operator needs to measure the delay on all network links. We refer to the collection of all link delays as the Link Delay Vector (LDV). Typical solutions to collect the LDV impose a substantial overhead on the network. In this paper, we propose a solution to measure the LDV in real-time with a low-overhead approach. In particular, we inject some flows into the network and infer the LDV based on the delay of those flows. To this end, the monitoring flows and their paths should be selected minimizing the network monitoring overhead. In this respect, the challenging issue is to select a proper combination of flows such that by knowing their delay it is possible to solve a set of linear equations and obtain a unique LDV. This combination of monitoring flows should be optimal according to some criteria and should meet some feasibility constraints. We first propose a mathematical formulation to select the optimal combination of flows, in form of an Integer Linear Programming (ILP) problem. Then we develop a heuristic algorithm to overcome the high computational complexity of existing ILP solvers. As a further step, we propose a meta-heuristic algorithm to solve the above-mentioned equations and infer the LDV. The challenging part of this step is the volatility of link delays. The proposed solution is evaluated over real-world emulated network topologies using the Mininet network emulator. Emulation results show the accuracy of the proposed solution with a negligible networking overhead in a real-time manner.
ago-2021
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore ING-INF/03 - TELECOMUNICAZIONI
English
Con Impact Factor ISI
https://ieeexplore.ieee.org/document/9518389
Tajiki, M.m., Petroudi, S., Salsano, S., Uhlig, S., Castro, I. (2021). Optimal Estimation of Link Delays Based on End-to-End Active Measurements. IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 18(4), 4730-4743 [10.1109/TNSM.2021.3106109].
Tajiki, Mm; Petroudi, Shg; Salsano, S; Uhlig, S; Castro, I
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
Optimal_Estimation_of_Link_Delays_9518389.pdf

solo utenti autorizzati

Tipologia: Versione Editoriale (PDF)
Licenza: Copyright dell'editore
Dimensione 3.29 MB
Formato Adobe PDF
3.29 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/298299
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? 2
social impact