Name
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. © 2016 Elsevier Inc. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jpdc.2016.05.001 | Journal of Parallel and Distributed Computing |
Keywords | Field | DocType |
Algorithm,Data center networks,DCell networks,Disjoint paths | Discrete mathematics,Combinatorics,Disjoint sets,Vertex (geometry),Upper and lower bounds,Mathematics,Scalability,Distributed computing | Journal |
Volume | ISSN | Citations |
96 | 07437315 | 8 |
PageRank | References | Authors |
0.47 | 19 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xi Wang | 1 | 85 | 6.56 |
| Jianxi Fan | 2 | 718 | 60.15 |
| Lin Cheng-Kuan | 3 | 25 | 1.11 |
| Xiaohua Jia | 4 | 4609 | 303.30 |