J. Abley, B. Black, and V. Gill, Goals for IPv6 Site-Multihoming Architectures, RFC, vol.3582, 2003.
DOI : 10.17487/rfc3582

M. Al-fares, A. Loukissas, and A. Vahdat, A scalable, commodity data center network architecture, ACM SIGCOMM Computer Communication Review, vol.38, issue.4, pp.63-74, 2008.
DOI : 10.1145/1402946.1402967

J. Eric, . Anderson, E. Thomas, and . Anderson, On the stability of adaptive routing in the presence of congestion control, INFOCOM 2003. Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, pp.948-958, 2003.

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

B. Awerbuch, D. Robert, and . 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

D. Balouek, A. Carpen-amarie, G. Charrier, F. Desprez, E. Jeannot et al., Adding Virtualization Capabilities to the Grid???5000 Testbed, Cloud Computing and Services Science, pp.3-20, 2013.
DOI : 10.1007/978-3-319-04519-1_1
URL : https://hal.archives-ouvertes.fr/hal-00946971

S. Barre, C. Paasch, and O. Bonaventure, MultiPath TCP: From Theory to Practice, Lecture Notes in Computer Science, vol.6640, pp.444-457, 2011.
DOI : 10.1007/978-3-642-20757-0_35

M. Benaïm, Dynamics of stochastic approximation algorithms, Séminaire de Probabilités, pp.1-68, 1999.
DOI : 10.1007/978-1-4757-1947-5

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

C. Chirichella, D. Rossi, C. Testa, T. Friedman, and A. Pescape, 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

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. Cole and Y. Tao, The price of anarchy of large walrasian auctions, 2015.

R. Colini-baldeschi, R. Cominetti, and M. Scarsini, On the Price of Anarchy of Highly Congested Nonatomic Network Games, 9th International Symposium of Algorithmic Game Theory (SAGT), number 9928 in LNCS, pp.117-128, 2016.
DOI : 10.1007/978-3-662-53354-3_10

P. Coucheney, B. Gaujal, and P. Mertikopoulos, 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

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

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

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

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

W. Krichene, B. Drighès, and A. Bayen, 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.

A. Kvalbein, C. Dovrolis, and C. Muthu, 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

B. Lantz, B. Heller, and N. Mckeown, 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

D. Monderer and L. Shapley, Potential games. Games and economic behavior, pp.124-143, 1996.

A. Semen, N. , and D. Yudin, Problem Complexity and Method Efficiency in Optimization, 1983.

A. Orda, R. Rom, and N. Shimkin, Competitive routing in multiuser communication networks, IEEE/ACM Transactions on Networking, vol.1, issue.5, pp.510-521, 1993.
DOI : 10.1109/90.251910

T. Roughgarden and E. Tardos, How bad is selfish routing, Journal of the ACM, vol.49, issue.2, pp.239-259, 2002.

G. Berger, S. , and M. Heusse, ipmt: Internet protocols measurement tools. https://forge.imag.fr/projects

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

S. Shalunov, G. Hazel, J. Iyengar, and M. Kuehlewind, Low Extra Delay Background Transport (LEDBAT), RFC, vol.6817, 2012.
DOI : 10.17487/rfc6817

B. Veal, K. Li, and D. Lowenthal, New Methods for Passive Estimation of TCP Round-Trip Times, Passive and Active Network Measurement, pp.121-134, 2005.
DOI : 10.1007/978-3-540-31966-5_10

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

R. N°-8959 and R. Centre-grenoble-?-rhône-alpes, Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399