Improved Routing in the Data Centre Networks HCN and BCN

We present improved one-to-one routing algorithms in the data centre networks HCN and BCN, in that our routing algorithms result in much shorter paths when compared with existing algorithms. We also present a much tighter analysis of HCN and BCN by observing that there is a very close relationship between the data centre networks HCN and the interconnection networks known as WK-recursive networks. We use existing results for 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.