Fault-Tolerant Routing in DCell Networks

Data center networks (hereinafter DCNs) have become increasingly crucial to various cloud applications, as the advance of cloud computing. The k-dimensional DCell based on n-port switches (k\geq 0 and n\geq 2),D
_k,n
, is a suitable DCN with high network capacity. In this paper, we study a fault-free path join any two fault-free different vertices of D
_k,n
with a faulty vertex set F\subset V(D
_k,n
) and |F|\leq n+k-2$. Besides, we study the maximal length of the paths, less than or equal to 2
^k+1
+3, where it is studied that the diameter of D
_k,n
has an upper bound 2
^k+1
-1. This paper also demonstrates that the fault diameter of D
_k,n
is less than or equal to 2
^k+1
+3. These results are fundamental for fault-tolerant in DCell networks.