Constructing dual-CISTs of DCell data center networks

Abstract The k-dimensional data center network with n port switches, denoted by Dk,n, has been proposed as a structure of the server-centric network and it was required to have a high reliability on data transmission. A set of t spanning trees in a graph G are called completely independent spanning trees (CISTs for short) if for every pair of nodes x, y ∈ V(G), the paths joining x and y in any two trees have neither node nor edge in common, except for x and y. In particular, if t = 2 , the two CISTs are called a dual-CIST. Although it has been proved that determining if a graph G admits t CISTs is an NP-complete problem even for t = 2 , the construction of multiple CISTs on the underlying graph of a network has applications in the fault-tolerance of data transmission. In this paper, we provide a recursive construction for building a dual-CIST on Dk,n for k ≥ 0 and n ≥ 6.

[1]  Cheng-Kuan Lin,et al.  An efficient algorithm to construct disjoint path covers of DCell networks , 2016, Theor. Comput. Sci..

[2]  Cheng-Kuan Lin,et al.  Vertex-disjoint paths in DCell networks , 2016, J. Parallel Distributed Comput..

[3]  Rong-Xia Hao,et al.  The pessimistic diagnosability of data center networks , 2018, Inf. Process. Lett..

[4]  Kung-Jui Pai,et al.  Constructing two completely independent spanning trees in hypercube-variant networks , 2016, Theor. Comput. Sci..

[5]  Toru Hasunuma,et al.  Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees , 2015, IWOCA.

[6]  Qinghai Liu,et al.  Ore's condition for completely independent spanning trees , 2014, Discret. Appl. Math..

[7]  Cheng-Kuan Lin,et al.  Diagnosability Evaluation of the Data Center Network DCell , 2018, Comput. J..

[8]  Cheng-Kuan Lin,et al.  The restricted h-connectivity of the data center network DCell , 2016, Discret. Appl. Math..

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

[10]  Kung-Jui Pai,et al.  Completely Independent Spanning Trees on Some Interconnection Networks , 2014, IEICE Trans. Inf. Syst..

[11]  Jou-Ming Chang,et al.  Completely Independent Spanning Trees on Complete Graphs, Complete Bipartite Graphs and Complete Tripartite Graphs , 2013 .

[12]  Toru Hasunuma,et al.  Completely independent spanning trees in the underlying graph of a line digraph , 2000, Discret. Math..

[13]  Xiao-Wen Qin,et al.  Conditional edge-fault-tolerant Hamiltonicity of the data center network , 2018, Discret. Appl. Math..

[14]  Yota Otachi,et al.  Completely Independent Spanning Trees in (Partial) k-Trees , 2015, Discuss. Math. Graph Theory.

[15]  Jianxi Fan,et al.  Constructing completely independent spanning trees in crossed cubes , 2017, Discret. Appl. Math..

[16]  Xiaohua Jia,et al.  Hamiltonian Properties of DCell Networks , 2015, Comput. J..

[17]  Ferenc Péterfalvi,et al.  Two counterexamples on completely independent spanning trees , 2012, Discret. Math..

[18]  Toru Hasunuma,et al.  Completely Independent Spanning Trees in Maximal Planar Graphs , 2002, WG.

[19]  Qinghai Liu,et al.  Degree condition for completely independent spanning trees , 2016, Inf. Process. Lett..

[20]  Toru Araki,et al.  Dirac's Condition for Completely Independent Spanning Trees , 2014, J. Graph Theory.

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

[22]  Toru Hasunuma,et al.  Completely independent spanning trees in torus networks , 2012, Networks.

[23]  Samee Ullah Khan,et al.  On the Connectivity of Data Center Networks , 2013, IEEE Communications Letters.

[24]  Olivier Togni,et al.  Completely independent spanning trees in some regular graphs , 2014, Discret. Appl. Math..

[25]  Hung-Yi Chang,et al.  A Note on the Degree Condition of Completely Independent Spanning Trees , 2015, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..