TY - GEN
T1 - On routing algorithms for the DPillar data centre networks
AU - Kiasari, Abbas Eslami
AU - Navaridas, Javier
AU - Stewart, Iain A.
PY - 2015/1/1
Y1 - 2015/1/1
N2 - The DPillar data centre networks were introduced as an attractive topology for server-centric data centre networks and have recently received considerable attention. In this paper, we first derive analytically, and validate experimentally, the average hop count and the aggregate bottleneck throughput of the DPillar networks with a focus on single-path routing algorithms and the all-to-all traffic pattern. We use these models to explore the design space of the DPillar networks as a case study. In addition, we discuss the limitations of the original routing algorithms, showing that they do not benefit from the rich connectivity provided by the DPillar network and consequently do not tolerate link failures very well. To overcome these limitations we propose a collection of routing algorithms which keep the simplicity of the original but enable a more effective utilisation of the network. We empirically evaluate our proposed routing algorithms and we find that they outperform the original algorithms as regards network throughput (∼ 2x), average hop count (∼ 5% − 10%), load balance and fault tolerance.
AB - The DPillar data centre networks were introduced as an attractive topology for server-centric data centre networks and have recently received considerable attention. In this paper, we first derive analytically, and validate experimentally, the average hop count and the aggregate bottleneck throughput of the DPillar networks with a focus on single-path routing algorithms and the all-to-all traffic pattern. We use these models to explore the design space of the DPillar networks as a case study. In addition, we discuss the limitations of the original routing algorithms, showing that they do not benefit from the rich connectivity provided by the DPillar network and consequently do not tolerate link failures very well. To overcome these limitations we propose a collection of routing algorithms which keep the simplicity of the original but enable a more effective utilisation of the network. We empirically evaluate our proposed routing algorithms and we find that they outperform the original algorithms as regards network throughput (∼ 2x), average hop count (∼ 5% − 10%), load balance and fault tolerance.
KW - Analytical modelling
KW - Data centre network
KW - Design space exploration
KW - Interconnection network
KW - Performance evaluation
KW - Routing algorithms
UR - http://www.scopus.com/inward/record.url?scp=84951846153&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-27140-8_23
DO - 10.1007/978-3-319-27140-8_23
M3 - Conference contribution
AN - SCOPUS:84951846153
SN - 9783319271392
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 329
EP - 343
BT - Algorithms and Architectures for Parallel Processing - 15th International Conference, ICA3PP 2015, Proceedings
A2 - Wang, Guojun
A2 - Zomaya, Albert
A2 - Perez, Gregorio Martinez
A2 - Li, Kenli
PB - Springer Nature
T2 - 15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015
Y2 - 18 November 2015 through 20 November 2015
ER -