Dynamic Network Delay Cartography

DOI10.1109/TIT.2014.2311802zbMATH Open1360.94031arXiv1204.5507OpenAlexW2045322901MaRDI QIDQ2986405FDOQ2986405

Georgios B. Giannakis, Ketan Rajawat, Emiliano Dall'Anese

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Path delays in IP networks are important metrics, required by network operators for assessment, planning, and fault diagnosis. Monitoring delays of all source-destination pairs in a large network is however challenging and wasteful of resources. The present paper advocates a spatio-temporal Kalman filtering approach to construct network-wide delay maps using measurements on only a few paths. The proposed network cartography framework allows efficient tracking and prediction of delays by relying on both topological as well as historical data. Optimal paths for delay measurement are selected in an online fashion by leveraging the notion of submodularity. The resulting predictor is optimal in the class of linear predictors, and outperforms competing alternatives on real-world datasets.

Full work available at URL: https://arxiv.org/abs/1204.5507

Mathematics Subject Classification ID

Inference from spatial processes (62M30) Inference from stochastic processes and prediction (62M20) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Communication theory (94A05)

This page was built for publication: Dynamic Network Delay Cartography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986405)