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 b...

Full description

Saved in:
Bibliographic Details
Published in2014 Second International Symposium on Computing and Networking pp. 212 - 218
Main Author Stewart, Iain A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2014
Subjects
Algorithm design and analysis
BCN
Bismuth
data centre networks
HCN
Indexes
Network topology
one-to-one routing
Routing
Switches
Topology
WK-recursive networks
Online AccessGet full text
ISSN2379-1888
DOI10.1109/CANDAR.2014.16

Cover

More Information
Summary: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.
ISSN:2379-1888
DOI:10.1109/CANDAR.2014.16