A. Erickson
Improved routing algorithms in the dual-port datacenter networks HCN and BCN
Erickson, A.; Stewart, I.A.; Pascual, J.A.; Navaridas, J.
Abstract
We present significantly improved one-to-one routing algorithms in the datacenter networks HCN and View the MathML source 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 View the MathML sourceby 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 View the MathML source. Furthermore, we empirically evaluate our new routing algorithms for View the MathML source, 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.
Citation
Erickson, A., Stewart, I., Pascual, J., & Navaridas, J. (2017). Improved routing algorithms in the dual-port datacenter networks HCN and BCN. Future Generation Computer Systems, 75, 58-71. https://doi.org/10.1016/j.future.2017.05.004
Journal Article Type | Article |
---|---|
Acceptance Date | May 5, 2017 |
Online Publication Date | May 11, 2017 |
Publication Date | May 11, 2017 |
Deposit Date | May 11, 2017 |
Publicly Available Date | May 12, 2017 |
Journal | Future Generation Computer Systems |
Print ISSN | 0167-739X |
Electronic ISSN | 1872-7115 |
Publisher | Elsevier |
Peer Reviewed | Peer Reviewed |
Volume | 75 |
Pages | 58-71 |
DOI | https://doi.org/10.1016/j.future.2017.05.004 |
Public URL | https://durham-repository.worktribe.com/output/1379542 |
Related Public URLs | http://community.dur.ac.uk/i.a.stewart/Papers/BCNDataCentreNetworks.pdf |
Files
Published Journal Article
(1.1 Mb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Accepted Journal Article
(770 Kb)
PDF
Publisher Licence URL
http://creativecommons.org/licenses/by/4.0/
Copyright Statement
Creative Commons Attribution License (CC BY)
This article is available under the terms of the Creative Commons Attribution License (CC BY).
You may copy and distribute the article, create extracts, abstracts and new works from the article, alter and revise the article, text or data mine the article and otherwise reuse the article commercially (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 you or your use of the work.
Permission is not required for this type of reuse.
You might also like
The stellar transformation: from interconnection networks to datacenter networks
(2016)
Journal Article
The influence of datacenter usage on symmetry in datacenter network design
(2017)
Journal Article
Edge-pancyclicity and edge-bipancyclicity of faulty folded hypercubes
(2016)
Journal Article
On the computational complexity of routing in faulty k-ary n-cubes and hypercubes.
(2012)
Journal Article
Downloadable Citations
About Durham Research Online (DRO)
Administrator e-mail: dro.admin@durham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search