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.
Type de document :
Communication dans un congrès
Ching-Hsien Hsu; Xiaoming Li; Xuanhua Shi; Ran Zheng. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. Springer, Lecture Notes in Computer Science, LNCS-8147, pp.61-70, 2013, Network and Parallel Computing. 〈10.1007/978-3-642-40820-5_6〉
Liste complète des métadonnées

Littérature citée [22 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01513760
Contributeur : Hal Ifip <>
Soumis le : mardi 25 avril 2017 - 14:33:27
Dernière modification le : mardi 25 avril 2017 - 14:35:50
Document(s) archivé(s) le : mercredi 26 juillet 2017 - 13:59:00

Fichier

978-3-642-40820-5_6_Chapter.pd...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Citation

Xi Wang, Jianxi Fan, Baolei Cheng, Wenjun Liu, Yan Wang. One-to-One Disjoint Path Covers in DCell. Ching-Hsien Hsu; Xiaoming Li; Xuanhua Shi; Ran Zheng. 10th International Conference on Network and Parallel Computing (NPC), Sep 2013, Guiyang, China. Springer, Lecture Notes in Computer Science, LNCS-8147, pp.61-70, 2013, Network and Parallel Computing. 〈10.1007/978-3-642-40820-5_6〉. 〈hal-01513760〉

Partager

Métriques

Consultations de la notice

49

Téléchargements de fichiers

37