Improved routing algorithms in the dual-port datacenter networks HCN and BCN

Alejandro Erickson, Iain A. Stewart, Jose A. Pascual, Javier Navaridas
2017 Future generations computer systems  
2017) 'Improved routing algorithms in the dual-port datacenter networks HCN and BCN.', Future generation computer systems., 75 . pp. 58-71. (including reuse and/or resale of the article) without permission from Elsevier. You must give appropriate credit to the original work, together with a link to the formal publication through the relevant DOI and a link to the Creative Commons user license above. You must indicate if any changes are made but not in any way that suggests the licensor endorses
more » ... you or your use of the work. Permission is not required for this type of reuse. Additional information: Use policy The full-text may be used and/or reproduced, and given to third parties in any format or medium, without prior permission or charge, for personal research or study, educational, or not-for-prot purposes provided that: • a full bibliographic reference is made to the original source • a link is made to the metadata record in DRO • the full-text is not changed in any way The full-text must not be sold in any format or medium without the formal permission of the copyright holders. Please consult the full DRO policy for further details. Abstract 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 emphasise that existing theoretical research can impact upon modern computational platforms. Highlights Improved routing algorithms for the datacenter networks HCN and BCN are proposed. New routing algorithms are derived from algorithms for WK-recursive networks. Routing algorithms are simulated for a variety of traffic patterns and workloads. Our routing algorithms massively improve on existing ones.
doi:10.1016/j.future.2017.05.004 fatcat:ojcarxzokvdcbpelwgqspiqgvu