T. C. Hu, Multi-Commodity Network Flows, Operations Research, vol.11, issue.3, pp.344-360, 1963.
DOI : 10.1287/opre.11.3.344

B. Awerbuch and R. D. Kleinberg, Adaptive routing with end-to-end feedback, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.45-53, 2004.
DOI : 10.1145/1007352.1007367

S. Bubeck and N. Cesa-bianchi, Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems, Machine Learning, pp.1-122, 2012.
DOI : 10.1561/2200000024

W. Krichene, On the convergence of no-regret learning in selfish routing, Proceedings of the 31st International Conference on Machine Learning (ICML-14), pp.163-171, 2014.

X. Wu and X. Yang, DARD: Distributed Adaptive Routing for Datacenter Networks, 2012 IEEE 32nd International Conference on Distributed Computing Systems, pp.32-41, 2012.
DOI : 10.1109/ICDCS.2012.69
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.9421

W. Cui and C. Qian, DiFS, Proceedings of the tenth ACM/IEEE symposium on Architectures for networking and communications systems, ANCS '14, pp.53-64, 2014.
DOI : 10.1145/2658260.2658266

S. Barre, MultiPath TCP: From Theory to Practice, NET- WORKING 2011, pp.444-457, 2011.
DOI : 10.1007/978-3-642-20757-0_35
URL : https://hal.archives-ouvertes.fr/hal-01583423

B. Veal, New methods for passive estimation of TCP roundtrip times, Passive and Active Network Measurement, pp.121-134, 2005.

A. Khanna and J. Zinky, The revised ARPANET routing metric, ACM SIGCOMM Computer Communication Review, vol.19, issue.4, pp.45-56, 1989.
DOI : 10.1145/75247.75252

B. Fortz and M. Thorup, Optimizing OSPF/IS-IS weights in a changing world, IEEE Journal on Selected Areas in Communications, vol.20, issue.4, 2002.
DOI : 10.1109/JSAC.2002.1003042
URL : https://hal.archives-ouvertes.fr/hal-01255600

A. Kvalbein, Multipath load-adaptive routing: putting the emphasis on robustness and simplicity, 2009 17th IEEE International Conference on Network Protocols, pp.203-212, 2009.
DOI : 10.1109/ICNP.2009.5339682
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.205.2482

B. Jonglez and B. Gaujal, Distributed Adaptive Routing in Communication Networks, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01386832

P. Coucheney, Penalty-Regulated Dynamics and Robust Learning Procedures in Games, Mathematics of Operations Research, vol.40, issue.3, pp.611-633, 2015.
DOI : 10.1287/moor.2014.0687
URL : https://hal.archives-ouvertes.fr/hal-01235243

A. Orda, Competitive routing in multiuser communication networks, IEEE/ACM Transactions on Networking, vol.1, issue.5, pp.510-521, 1993.
DOI : 10.1109/90.251910
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.3081

A. S. Nemirovski and D. B. Yudin, Problem Complexity and Method Efficiency in Optimization, 1983.

G. Christodoulou and E. Koutsoupias, The price of anarchy of finite congestion games, Proceedings of the thirty-seventh annual ACM symposium on Theory of computing , STOC '05, 2005.
DOI : 10.1145/1060590.1060600

R. Colini-baldeschi, On the Price of Anarchy of Highly Congested Nonatomic Network Games, 9th International Symposium of Algorithmic Game Theory (SAGT) no. 9928 in LNCS, pp.117-128, 2016.
DOI : 10.1103/PhysRevLett.101.128701

M. Mitzenmacher, The power of two choices in randomized load balancing, IEEE Transactions on Parallel and Distributed Systems, vol.12, issue.10, pp.1094-1104, 2001.
DOI : 10.1109/71.963420

P. Coucheney, Self-optimizing routing in manets with multiclass flows, Personal Indoor and Mobile Radio Communications (PIMRC), 2010 IEEE 21st International Symposium on, pp.2751-2756, 2010.
DOI : 10.1109/pimrc.2010.5671812
URL : https://hal.archives-ouvertes.fr/hal-00788876

S. Shalunov, Low Extra Delay Background Transport (LED- BAT), RFC, vol.6817, 2012.
DOI : 10.17487/rfc6817
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.6981

C. Chirichella, Passive bufferbloat measurement exploiting transport layer information, 2013 IEEE Global Communications Conference (GLOBECOM), pp.2963-2968, 2013.
DOI : 10.1109/GLOCOM.2013.6831525
URL : https://hal.archives-ouvertes.fr/hal-00858200

D. Gamarnik and S. Meyn, On exponential ergodicity of multiclass queueing networks, Queueing Systems, vol.26, issue.8, pp.109-133, 2010.
DOI : 10.1017/CBO9780511626630

B. Lantz, A network in a laptop, Proceedings of the Ninth ACM SIGCOMM Workshop on Hot Topics in Networks, Hotnets '10, p.19, 2010.
DOI : 10.1145/1868447.1868466

G. B. Sabbatel and M. Heusse, ipmt: Internet protocols measurement tools

D. Balouek, Adding Virtualization Capabilities to the Grid???5000 Testbed, Cloud Computing and Services Science of Communications in Computer and Information Science, pp.3-20, 2013.
DOI : 10.1007/978-3-319-04519-1_1
URL : https://hal.archives-ouvertes.fr/hal-00946971

S. Andradóttir, A Stochastic Approximation Algorithm with Varying Bounds, Operations Research, vol.43, issue.6, pp.1037-1048, 1995.
DOI : 10.1287/opre.43.6.1037

W. H. Sandholm, Population Games and Evolutionary Dynamics, 2010.

M. Benaïm, Dynamics of stochastic approximations, Séminaire de Probabilités, pp.1-68, 1999.

D. Monderer and L. Shapley, Potential Games, Games and Economic Behavior, vol.14, issue.1, pp.124-143, 1996.
DOI : 10.1006/game.1996.0044