Vertex-disjoint paths in DCell networks

The DCell network is suitable for massively scalable data centers with high network capacity by only using commodity switches. In this paper, we construct n+k−1 vertex-disjoint paths between every two distinct vertices of the DCell network. Their longest length is not greater than 2^k+1+3, where it was proved that the diameter of a k-dimensional DCell, DCell_k, has an upper bound 2^k+1−1. Furthermore, we propose an O(k2^k) algorithm for finding vertex-disjoint paths between every two distinct vertices in DCell networks. Finally, we give the simulation result of the maximal length of disjoint paths gotten by our algorithm.