R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris, Practical, distributed network coordinates, ACM SIGCOMM Computer Communication Review, vol.34, issue.1, pp.113-118, 2004.
DOI : 10.1145/972374.972394
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.6459

F. Dabek, R. Cox, F. Kaashoek, and R. Morris, Vivaldi: a decentralized network coordinate system, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, pp.15-26, 2004.

V. Ramasubramanian, D. Malkhi, F. Kuhn, M. Balakrishnan, A. Gupta et al., On the treeness of internet latency and bandwidth, Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems, SIGMETRICS '09, pp.61-72, 2009.
DOI : 10.1145/1555349.1555357

I. Abraham, M. Balakrishnan, F. Kuhn, D. Malkhi, V. Ramasubramanian et al., Reconstructing approximate tree metrics, Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing, PODC '07, pp.43-52, 2007.
DOI : 10.1145/1281100.1281110
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.367.3246

C. Lumezanu, R. Baden, N. Spring, and B. Bhattacharjee, Triangle inequality variations in the internet, Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference, IMC '09, pp.177-183, 2009.
DOI : 10.1145/1644893.1644914

E. Lebhar, P. Fraigniaud, and L. Viennot, The inframetric model for the internet, Proceedings of the 27th IEEE International Conference on Computer Communications (IN- FOCOM), pp.1085-1093, 2008.
URL : https://hal.archives-ouvertes.fr/inria-00471723

S. Assmann, D. Johnson, D. Kleitman, and J. Leung, On a dual version of the one-dimensional bin packing problem, Journal of Algorithms, vol.5, issue.4, pp.502-525, 1984.
DOI : 10.1016/0196-6774(84)90004-X

O. Beaumont, N. Bonichon, P. Duchon, and H. Larchevêque, Distributed Approximation Algorithm for Resource Clustering, SIROCCO 2008, ser. Lecture Notes in Computer Science, pp.61-73, 2008.
DOI : 10.1007/978-3-540-69355-0_7
URL : https://hal.archives-ouvertes.fr/hal-00396449

O. Beaumont, N. Bonichon, P. Duchon, and H. Larcheveque, Distributed Approximation Algorithm for Resource Clustering, OPODIS 2008, pp.564-567, 2008.
DOI : 10.1007/978-3-540-69355-0_7
URL : https://hal.archives-ouvertes.fr/hal-00396449

D. P. Anderson, BOINC: A System for Public-Resource Computing and Storage, Fifth IEEE/ACM International Workshop on Grid Computing, pp.4-10, 2004.
DOI : 10.1109/GRID.2004.14

J. Csirik and G. J. Woeginger, Resource augmentation for online bounded space bin packing, Journal of Algorithms, vol.44, issue.2, pp.308-320, 2002.
DOI : 10.1016/S0196-6774(02)00202-X
URL : http://repository.tue.nl/623753

L. Epstein and R. Van-stee, Online bin packing with resource augmentation, Discrete Optimization, vol.4, issue.3-4, pp.322-333, 2007.
DOI : 10.1016/j.disopt.2007.09.004
URL : http://doi.org/10.1016/j.disopt.2007.09.004

B. Clark, S. David, and J. Charles, Unit disk graphs, Discrete mathematics, pp.165-177, 1990.
DOI : 10.1016/0012-365x(90)90358-o
URL : http://doi.org/10.1016/0012-365x(90)90358-o

L. Lovász and M. Plummer, Matching theory, 1986.
DOI : 10.1090/chel/367

H. Larchevêque, Agrégation de ressources avec contrainte de distance : applications aux plateformes de grandé echelle, 2010.