Research on undirected double-loop data center networks

摘要：

　　To solve the performance bottleneck of tree-based structure and single point failure issues of data center networks,this thesis proposes an undirected double-loop data center network structure,which makes use of the cyclic graphs excellent properties on the node number and path length to achieve high performance,good scalability and faulttolerance.Main issues include the method to build the minimum distance diagram of undirected double-loop networks,the algorithm to calculate its diameter,and the step to build optimal undirected double-loop networks,etc.We prove that the diameter of the undirected double-loop network is equal to the height of its tree structure,and propose a rapid algorithm to calculate the diameter,and find that there are lots of optimal undirected double-loop networks in some infinite clusters.Finally,the lower bound proposed by Yebra is verified by experiment.According to these results above,the transmission performance of undirected double-loop data center networks will be optimized.

关键词： Data center Undirected double-loop networks Minimum distance diagram Shortest path Optimal network

作者: Yebin Chen Weipeng Tai Ying Li Xiao Zheng

作者单位: School of Computer Science Anhui University of Technology Maanshan Anhui,China School of Science and Engineering Maanshan Teachers College Maanshan Anhui,China

会议类型: 国际会议

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

会议地点: 安徽黄山

会议语种:英文

页码: 180-183

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