Optimal Estimation of Link Delays based on End-to-End Active Measurements
Mohammad Mahdi Tajiki, Seyed Hesamedin Ghasemi Petroudi, Stefano, Salsano, Steve Uhlig, Ignacio Castro

TL;DR
This paper introduces a low-overhead, real-time method for estimating link delays in IP networks by selecting optimal flows and inferring the delay vector through mathematical and heuristic algorithms, validated via emulation.
Contribution
It presents a novel approach combining ILP, heuristic, and meta-heuristic algorithms for efficient link delay estimation with minimal network overhead.
Findings
Accurate link delay estimation with negligible overhead
Effective flow selection reduces measurement complexity
Validated approach on real-world emulated networks
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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
