A Node-to-Set Disjoint Path Routing Algorithm in DCell Networks

摘要：

　　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.

关键词： DCell Node-to-Set Disjoint Path Routing Algorithm

作者: Xi Wang Jianxi Fan

作者单位: School of Computer Science and Technology,Soochow University Suzhou 215006,China

会议类型: 国际会议

会议名称: 2014 2nd International Conference on Advanced Cloud and Big Data (CBD 2014)(2014年先进云计算和大数据国际会议)

会议地点: 安徽黄山

会议语种:英文

页码: 196-200

在线出版日期: 2014-11-20（万方平台首次上网日期，不代表论文的发表时间）