Skip to Main content Skip to Navigation
Conference papers

Scalable Monitoring Heuristics for Improving Network Latency

Abstract : We consider a routing overlay in which the delay of a path can be obtained at some fixed cost by sending probe packets, and investigate the joint minimization of the probing cost and the routing delay. Assuming that link delays are modelled by Markov chains, this problem can be cast as a Markov Decision Process (MDP). Unfortunately, computing the exact solution of this MDP is prohibitively expensive due to the well-known "curse of dimensionality". In this work we propose two scalable approaches that are fast enough to provide efficient solutions on practical time scales. We analyze the complexity of both approaches, and evaluate their accuracy in small synthetic scenarios for which the optimal monitoring policy can be computed. Finally, the robustness and the scalability of the proposed solutions are analyzed using real delay data collected over the Internet.
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.laas.fr/hal-02413636
Contributor : Olivier Brun <>
Submitted on : Monday, December 16, 2019 - 11:51:45 AM
Last modification on : Tuesday, October 6, 2020 - 3:33:02 PM
Long-term archiving on: : Tuesday, March 17, 2020 - 5:20:47 PM

File

report.pdf
Files produced by the author(s)

Identifiers

Citation

Maxime Mouchet, Martin Randall, Marine Ségneré, Isabel Amigo, Pablo Belzarena, et al.. Scalable Monitoring Heuristics for Improving Network Latency. NOMS 2020 : IEEE/IFIP Network Operations and Management Symposium, Apr 2020, Budapest, Hungary. ⟨10.1109/NOMS47738.2020.9110341⟩. ⟨hal-02413636⟩

Share

Metrics

Record views

239

Files downloads

168