Paper Info
Title
A Node-to-Set Disjoint Path Routing Algorithm in DCell Networks
Abstract
Data center networks become increasingly important with the growth of cloud computing. For any integers k ≥ 0 and n ≥ 2, the k-dimensional DCell, Dk,n, has been proposed for one of the most important data center networks as a server-centric data center network structure. In this paper, we propose an efficient algorithm for finding disjoint paths in node-to-set routing of DCell networks. The algorithm construct (n + k--1)-disjoint paths on Dk,n in O(k2) time and their maximum length is bounded by 2k+2 -- 1, where the diameter of Dk,n is at most 2k+1 -- 1.
Year
DOI
Venue
2014
10.1109/.32
CBD
Keywords
Field
DocType
DCell,Node-to-Set,Disjoint Path Routing,Algorithm
Integer,Discrete mathematics,Algorithm design,Disjoint sets,Computer science,Theoretical computer science,Fault tolerance,Time complexity,Data center,Bounded function,Cloud computing
Conference
ISSN
Citations 
PageRank 
1066-6192
0
0.34
References 
Authors
7
2
Name
Order
Citations
PageRank
Xi Wang1856.56
Jianxi Fan271860.15