Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01513760
Contributor : Hal Ifip <>
Submitted on : Tuesday, April 25, 2017 - 2:33:27 PM
Last modification on : Tuesday, April 25, 2017 - 2:35:50 PM
Long-term archiving on: : Wednesday, July 26, 2017 - 1:59:00 PM

File

978-3-642-40820-5_6_Chapter.pd...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Xi Wang, Jianxi Fan, Baolei Cheng, Wenjun Liu, Yan Wang. One-to-One Disjoint Path Covers in DCell. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. pp.61-70, ⟨10.1007/978-3-642-40820-5_6⟩. ⟨hal-01513760⟩

Share

Metrics

Record views

93

Files downloads

191