Paper Info
Title
Improved routing algorithms in the dual-port datacenter networks HCN and BCN.
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 emphasize that existing theoretical research can impact upon modern computational platforms.
Year
DOI
Venue
2017
10.1016/j.future.2017.05.004
Future Generation Computer Systems
Keywords
Field
DocType
Datacenters,Datacenter networks,HCN,BCN,One-to-one routing,WK-recursive networks,Performance metrics
Link-state routing protocol,Dynamic Source Routing,Computer science,Latency (engineering),Static routing,Stencil,Computer network,Real-time computing,Throughput,Interconnection,Routing algorithm,Distributed computing
Journal
Volume
ISSN
Citations 
75
0167-739X
2
PageRank 
References 
Authors
0.36
18
4
Name
Order
Citations
PageRank
Alejandro Erickson1145.84
Iain A. Stewart253651.15
Jose A. Pascual3425.03
Javier Navaridas420123.58