TY - JOUR
T1 - Vertex-disjoint paths in DCell networks
AU - Wang, Xi
AU - Fan, Jianxi
AU - Lin, Cheng-Kuan
AU - Jia, Xiaohua
PY - 2016/10/1
Y1 - 2016/10/1
N2 - 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.
AB - 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.
KW - Algorithm
KW - Data center networks
KW - DCell networks
KW - Disjoint paths
UR - http://www.scopus.com/inward/record.url?scp=84977090963&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84977090963&origin=recordpage
U2 - 10.1016/j.jpdc.2016.05.001
DO - 10.1016/j.jpdc.2016.05.001
M3 - 21_Publication in refereed journal
VL - 96
SP - 38
EP - 44
JO - Journal of Parallel and Distributed Computing
JF - Journal of Parallel and Distributed Computing
SN - 0743-7315
ER -