Vertex-disjoint paths in DCell networks

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal

13 Scopus Citations
View graph of relations

Author(s)

Related Research Unit(s)

Detail(s)

Original languageEnglish
Pages (from-to)38-44
Journal / PublicationJournal of Parallel and Distributed Computing
Volume96
Publication statusPublished - 1 Oct 2016

Abstract

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 2k+1+3, where it was proved that the diameter of a k-dimensional DCell, DCellk, has an upper bound 2k+1−1. Furthermore, we propose an O(k2k) 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.

Research Area(s)

  • Algorithm, Data center networks, DCell networks, Disjoint paths

Citation Format(s)

Vertex-disjoint paths in DCell networks. / Wang, Xi; Fan, Jianxi; Lin, Cheng-Kuan; Jia, Xiaohua.

In: Journal of Parallel and Distributed Computing, Vol. 96, 01.10.2016, p. 38-44.

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journal