Vertex-disjoint paths in DCell networks
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Related Research Unit(s)
|Journal / Publication||Journal of Parallel and Distributed Computing|
|Publication status||Published - 1 Oct 2016|
|Link to Scopus||https://www.scopus.com/record/display.uri?eid=2-s2.0-84977090963&origin=recordpage|
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.
- Algorithm, Data center networks, DCell networks, Disjoint paths