O. Brun, H. Hassan, and J. Vallet, Scalable, self-healing, and self-optimizing routing overlays, IFIP Networking, p.6472, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01239559

C. Caro, J. Doncel, and O. Brun, Optimal path discovery problem with homogeneous knowledge. Theory of Computing Systems, vol.64, p.227250, 2020.
URL : https://hal.archives-ouvertes.fr/hal-01149901

G. James, D. Witten, T. Hastie, and R. Tibshirani, An Introduction to Statistical Learning: With Applications in R, 2014.

A. Johnsson, B. Melander, and M. Björkman, On the analysis of packet-train probing schemes, proceedings of the International Conference on Communication in Computing, 2004.

B. Melander, M. Bjorkman, and P. Gunningberg, A new end-to-end probing and analysis method for estimating bandwidth bottlenecks, Global Telecommunications Conference, 2000. GLOBECOM '00. IEEE, vol.1, p.415420, 2000.

M. Mouchet, M. Randall, M. Ségneré, I. Amigo, P. Belzarena et al., Scalable monitoring heuristics for improving network latency, IEEE/IFIP Network Operations and Management Symposium (IEEE/IFIP NOMS 2020), 2020.
URL : https://hal.archives-ouvertes.fr/hal-02413636

S. Savage, A. Collins, E. Homan, J. Snell, and T. Anderson, The end-to-end eects of internet path selection, SIGCOMM Comput. Commun. Rev, vol.29, issue.4, p.289299, 1999.

S. Vaton, O. Brun, M. Mouchet, P. Belzarena, I. Amigo et al., Joint minimization of monitoring cost and delay in overlay networks: Optimal policies with a markovian approach, Journal of Network and Systems Management, vol.27, issue.1, p.188232, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01857738