J. F. Gantz and C. Chute, The diverse and exploding digital universe: An updated forecast of worldwide information growth through, IDC, 2008.

J. Dean, Experiences with MapReduce, an abstraction for large-scale computation, Proceedings of the 15th international conference on Parallel architectures and compilation techniques , PACT '06, pp.1-1, 2006.
DOI : 10.1145/1152154.1152155

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.140.9669

C. Guo, H. Wu, K. Tan, L. Shi, Y. Zhang et al., Dcell, ACM SIGCOMM Computer Communication Review, vol.38, issue.4, pp.75-86, 2008.
DOI : 10.1145/1402946.1402968

D. Li, C. Guo, H. Wu, K. Tan, Y. Zhang et al., FiConn: Using Backup Port for Server Interconnection in Data Centers, IEEE INFOCOM 2009, The 28th Conference on Computer Communications, pp.2276-2285, 2009.
DOI : 10.1109/INFCOM.2009.5062153

N. Mysore, R. Pamboris, A. Farrington, N. Huang, N. Miri et al., PortLand, ACM SIGCOMM Computer Communication Review, vol.39, issue.4, pp.39-50, 2009.
DOI : 10.1145/1594977.1592575

A. Greenberg, J. R. Hamilton, N. Jain, S. Kandula, C. Kim et al., VL2, ACM SIGCOMM Computer Communication Review, vol.39, issue.4, pp.51-62, 2009.
DOI : 10.1145/1594977.1592576

P. Costa, A. Donnelly, G. O-'shea, and A. Rowstron, CamCube: a key-based data center, 2010.

E. W. Dijkstra, A note on two problems in connexion with graphs, Numerische mathematik, pp.269-271, 1959.
DOI : 10.1007/BF01386390

R. W. Floyd, Algorithm 97: Shortest path, Communications of the ACM, vol.5, issue.6, p.345, 1962.
DOI : 10.1145/367766.368168

Y. Deng, RISC: A resilient interconnection network for scalable cluster storage systems, Journal of Systems Architecture, vol.54, issue.1-2, pp.70-80, 2008.
DOI : 10.1016/j.sysarc.2007.04.002

B. Parhami, Introduction to parallel processing: algorithms and architectures, Series in Computer Science, 2006.

D. Loguinov, A. Kumar, V. Rai, and S. Ganesh, Graph-theoretic analysis of structured peerto-peer systems: routing distances and fault resilience, Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, pp.395-406, 2003.
DOI : 10.1109/tnet.2005.857072
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.3145

L. A. Barroso, J. Dean, and U. Holzle, Web search for a planet: the google cluster architecture, IEEE Micro, vol.23, issue.2, pp.22-28, 2003.
DOI : 10.1109/MM.2003.1196112