One-to-One Disjoint Path Covers in DCell - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

One-to-One Disjoint Path Covers in DCell

(1) , (1) , (1, 2) , (1) , (1)
1
2

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.
Fichier principal
Vignette du fichier
978-3-642-40820-5_6_Chapter.pdf (569.84 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01513760 , version 1 (25-04-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

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⟩
35 View
76 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More