One-to-One Disjoint Path Covers in DCell

DCell has been proposed for one of the most important data center networks as a server centric data center network structure. DCell can support millions of servers with outstanding network capacity and provide good fault tolerance by only using commodity switches. In this paper, we prove that there exist r vertex disjoint paths {P i | 1≤i≤r} between any two distinct vertices u and v of DCell k ki¾?0 where r=n+k-1 and n is the vertex number of DCell 0. The result is optimal because of any vertex in DCell k has r neighbors with r=n+k-1.

[1]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[2]  Shin-Shin Kao,et al.  One-to-one disjoint path covers on k-ary n-cubes , 2011, Theor. Comput. Sci..

[3]  Xie-Bin Chen,et al.  Many-to-many disjoint paths in faulty hypercubes , 2009, Inf. Sci..

[4]  D. West.  Introduction to Graph Theory , 1995 .

[5]  Hyeong-Seok Lim,et al.  Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements , 2006, IEEE Trans. Parallel Distributed Syst..

[6]  Xie-Bin Chen,et al.  Paired many-to-many disjoint path covers of hypercubes with faulty edges , 2012, Inf. Process. Lett..

[7]  Lih-Hsing Hsu,et al.  The spanning connectivity of line graphs , 2011, Appl. Math. Lett..

[8]  Xiaola Lin,et al.  Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  Cheng-Kuan Lin,et al.  On the spanning connectivity of graphs , 2007, Discret. Math..

[10]  Yuan Yu,et al.  Dryad: distributed data-parallel programs from sequential building blocks , 2007, EuroSys '07.

[11]  Meijie Ma.  The spanning connectivity of folded hypercubes , 2010, Inf. Sci..

[12]  Sanjay Ghemawat,et al.  MapReduce: Simplified Data Processing on Large Clusters , 2004, OSDI.

[13]  Haitao Wu,et al.  Scalable and Cost-Effective Interconnection of Data-Center Servers Using Dual Server Ports , 2011, IEEE/ACM Transactions on Networking.

[14]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[15]  Jason Lee,et al.  Generalized DCell Structure for Load-Balanced Data Center Networks , 2010, 2010 INFOCOM IEEE Conference on Computer Communications Workshops.

[16]  Václav Koubek,et al.  Spanning multi-paths in hypercubes , 2007, Discret. Math..

[17]  Howard Gobioff,et al.  The Google file system , 2003, SOSP '03.

[18]  Cheng-Kuan Lin,et al.  The Spanning Connectivity of the (n, k)-star Graphs , 2006, Int. J. Found. Comput. Sci..

[19]  Hyeong-Seok Lim,et al.  Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements , 2009, IEEE Transactions on Computers.

[20]  Haitao Wu,et al.  FiConn: Using Backup Port for Server Interconnection in Data Centers , 2009, IEEE INFOCOM 2009.

[21]  Cheng-Kuan Lin,et al.  On spanning connected graphs , 2008, Discret. Math..

[22]  Yi-Ping Hung,et al.  Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model , 2009, J. Syst. Archit..

[23]  Xie-Bin Chen,et al.  Unpaired many-to-many vertex-disjoint path covers of a class of bipartite graphs , 2010, Inf. Process. Lett..