Routing Algorithms for Recursively-Defined Data Centre Networks
Routing Algorithms for Recursively-Defined Data Centre Networks
复制标题
DOI：
10.1109/trustcom.2015.616
复制
发表时间：
2015-08
期刊：
影响因子：
--
通讯作者：
Alejandro Erickson;A. E. Kiasari;J. Navaridas;I. A. Stewart
中科院分区：
文献类型：
--
作者：
Alejandro Erickson;A. E. Kiasari;J. Navaridas;I. A. Stewart
以服务器为中心的数据中心网络架构可以适应各种各样的网络拓扑。在这个竞技场中新提出的拓扑通常需要几轮分析和实验，以便它们可以实现其作为数据中心网络的全部潜力。我们提出了一个家庭的新的路由算法在两个著名的数据中心网络的这种类型，（广义）DCell和FiConn，使用的技术，可以更普遍地应用到类的网络，我们称之为完全连接的递归定义的网络。在这样做的时候，我们开发了一个分类的所有可能的路由从服务器节点到服务器节点在这些网络上，所谓的一般路线的顺序t，并发现，对于某些感兴趣的拓扑结构，我们的路由算法有效地产生的路径，是高达16%短于最好的以前已知的算法，并与最短路径。除了找到更短的路径，我们证明我们的算法也有良好的负载平衡性能。
The server-centric data centre network architecture can accommodate a wide variety of network topologies. Newly proposed topologies in this arena often require several rounds of analysis and experimentation in order that they might achieve their full potential as data centre networks. We propose a family of novel routing algorithms on two well-known data centre networks of this type, (Generalized) DCell and FiConn, using techniques that can be applied more generally to the class of networks we call completely connected recursively-defined networks. In doing so, we develop a classification of all possible routes from server-node to server-node on these networks, called general routes of order t, and find that for certain topologies of interest, our routing algorithms efficiently produce paths that are up to 16% shorter than the best previously known algorithms, and are comparable to shortest paths. In addition to finding shorter paths, we show evidence that our algorithms also have good load-balancing properties.