Improved routing algorithms in the dual-port datacenter networks HCN and BCN
Improved routing algorithms in the dual-port datacenter networks HCN and BCN
复制标题
DOI：
10.1016/j.future.2017.05.004
复制
发表时间：
2017-10
期刊：
影响因子：
--
通讯作者：
Alejandro Erickson;I. A. Stewart;J. A. Pascual;J. Navaridas
中科院分区：
文献类型：
--
作者：
Alejandro Erickson;I. A. Stewart;J. A. Pascual;J. Navaridas
我们提出了显着改进的一对一的路由算法在数据中心网络HCN和BCN中，我们的路由算法的结果在更短的路径时，与现有的路由算法相比。我们还提出了一个更严格的分析HCN和BCN通过观察，有一个非常密切的关系之间的数据中心网络HCN和被称为WK递归网络的互连网络。我们使用现有的结果WK递归网络证明我们的新的路由算法的最优性HCN，也显着帮助我们的路由算法在HCN和BCN的实施。此外，我们经验性地评估我们的新的BCN路由算法，对现有的，在一系列的指标有关的路径长度，吞吐量和延迟的交通模式所有对一，平分，蝴蝶，热区，多对所有，和均匀随机，我们还研究了工作负载的完成时间与MapReduce，模板和扫描，和非结构化应用程序。我们的研究结果不仅显着改善了我们的数据中心网络中的路由所有考虑的不同场景，但他们也强调，现有的理论研究可以影响现代计算平台。
We present significantly improved one-to-one routing algorithms in the datacenter networks HCN and BCN in that our routing algorithms result in much shorter paths when compared with existing routing algorithms. We also present a much tighter analysis of HCN and BCN by observing that there is a very close relationship between the datacenter networks HCN and the interconnection networks known as WK-recursive networks. We use existing results concerning WK-recursive networks to prove the optimality of our new routing algorithm for HCN and also to significantly aid the implementation of our routing algorithms in both HCN and BCN. Furthermore, we empirically evaluate our new routing algorithms for BCN, against existing ones, across a range of metrics relating to path-length, throughput, and latency for the traffic patterns all-to-one, bisection, butterfly, hot-region, many-all-to-all, and uniform-random, and we also study the completion times of workloads relating to MapReduce, stencil and sweep, and unstructured applications. Not only do our results significantly improve routing in our datacenter networks for all of the different scenarios considered but they also emphasize that existing theoretical research can impact upon modern computational platforms.