A Node-to-Set Disjoint Path Routing Algorithm in DCell Networks

Data center networks become increasingly important with the growth of cloud computing. For any integers k ≥ 0 and n ≥ 2, the k-dimensional DCell, D
_k,n
, has been proposed for one of the most important data center networks as a server-centric data center network structure. In this paper, we propose an efficient algorithm for finding disjoint paths in node-to-set routing of DCell networks. The algorithm construct (n + k - 1)-disjoint paths on D
_k,n
in O(k
²
) time and their maximum length is bounded by 2
^k+2
- 1, where the diameter of D
_k,n
is at most 2
^k+1
- 1.