One-to-one disjoint path covers in DCell

Abstract

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 {Pi | 1 ≤ i ≤ r} between any two distinct vertices u and v of DCellk (k ≥ 0) where r = n + k - 1 and n is the vertex number of DCell0. The result is optimal because of any vertex in DCellk has r neighbors with r = n + k - 1. © 2013 IFIP International Federation for Information Processing.