S. Ghemawat, H. Gobioff, and S. Leung, The Google file system, ACM SIGOPS Operating Systems Review, vol.37, issue.5, pp.29-43, 2003.
DOI : 10.1145/1165389.945450

J. Dean and S. Ghemawat, MapReduce, Communications of the ACM, vol.51, issue.1, pp.107-113, 2008.
DOI : 10.1145/1327452.1327492

M. Isard, M. Budiu, Y. Yu, A. Birrell, and D. , Dryad, ACM SIGOPS Operating Systems Review, vol.41, issue.3, pp.59-72, 2007.
DOI : 10.1145/1272998.1273005

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

C. Guo, G. Lu, D. Li, H. Wu, X. Zhang et al., BCube, ACM SIGCOMM Computer Communication Review, vol.39, issue.4, pp.63-74, 2009.
DOI : 10.1145/1594977.1592577

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

D. Li, C. Guo, H. Wu, K. Tan, Y. Zhang et al., Scalable and Cost-Effective Interconnection of Data-Center Servers Using Dual Server Ports, IEEE/ACM Transactions on Networking, vol.19, issue.1, pp.102-114, 2011.
DOI : 10.1109/TNET.2010.2053718

X. Lin, P. Philip, and L. Ni, Deadlock-free multicast wormhole routing in 2-D mesh multicomputers, IEEE Transactions on Parallel and Distributed Systems, vol.5, issue.8, pp.793-804, 1994.

N. Wang, C. Yen, and C. Chu, Multicast communication in wormhole-routed symmetric networks with hamiltonian cycle model, Journal of Systems Architecture, vol.51, issue.3, pp.165-183, 2005.
DOI : 10.1016/j.sysarc.2004.11.001

C. Lin, H. Huang, and L. Hsu, On the spanning connectivity of graphs, Discrete Mathematics, vol.307, issue.2, pp.285-289, 2007.
DOI : 10.1016/j.disc.2006.06.021

C. Lin, H. Huang, J. Tan, and L. Hsu, On spanning connected graphs, Discrete Mathematics, vol.308, issue.7, pp.1330-1333, 2008.
DOI : 10.1016/j.disc.2007.03.072
URL : http://doi.org/10.1016/j.disc.2007.03.072

J. Park, C. Kim, and S. Lim, Many-to-many disjoint path covers in hypercube-like interconnection networks with faulty elements, IEEE Transactions on Parallel and Distributed Systems, vol.17, issue.3, pp.227-240, 2006.
DOI : 10.1109/TPDS.2006.37

R. Caha and V. Koubek, Spanning multi-paths in hypercubes. Discrete mathematics, pp.2053-2066, 2007.
DOI : 10.1016/j.disc.2005.12.050
URL : http://doi.org/10.1016/j.disc.2005.12.050

X. Chen, Many-to-many disjoint paths in faulty hypercubes, Information Sciences, vol.179, issue.18, pp.3110-3115, 2009.
DOI : 10.1016/j.ins.2009.05.006

X. Chen, Paired many-to-many disjoint path covers of hypercubes with faulty edges, Information Processing Letters, vol.112, issue.3, pp.61-66, 2012.
DOI : 10.1016/j.ipl.2011.10.010

J. Park, H. Kim, and H. Lim, Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements, IEEE Transactions on Computers, vol.58, issue.4, pp.528-540, 2009.
DOI : 10.1109/TC.2008.160

M. Ma, The spanning connectivity of folded hypercubes???, Information Sciences, vol.180, issue.17, pp.3373-3379, 2010.
DOI : 10.1016/j.ins.2010.05.015

Y. Shih and S. Kao, One-to-one disjoint path covers on <mml:math altimg="si1.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>k</mml:mi></mml:math>-ary <mml:math altimg="si2.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mi>n</mml:mi></mml:math>-cubes, Theoretical Computer Science, vol.412, issue.35, pp.4513-4530, 2011.
DOI : 10.1016/j.tcs.2011.04.035

H. Hsu, C. Lin, H. Hung, and L. Hsu, THE SPANNING CONNECTIVITY OF THE (n,k)-STAR GRAPHS, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.415-434, 2006.
DOI : 10.1016/j.tcs.2005.02.007

X. Chen, Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs, Information Processing Letters, vol.110, issue.6, pp.203-205, 2010.
DOI : 10.1016/j.ipl.2009.12.004

P. Huanga and L. Hsub, The spanning connectivity of line graphs, Applied Mathematics Letters, vol.24, issue.9, pp.1614-1617, 2011.
DOI : 10.1016/j.aml.2011.04.013

M. Kliegl, J. Lee, J. Li, X. Zhang, C. Guo et al., Generalized DCell Structure for Load-Balanced Data Center Networks, 2010 INFOCOM IEEE Conference on Computer Communications Workshops, pp.1-5, 2010.
DOI : 10.1109/INFCOMW.2010.5466647
URL : http://hdl.handle.net/2117/8690