On the mathematics of data centre network topologies

Stewart, I.A.

Abstract

In a recent paper, combinatorial designs were used to construct switch-centric data centre networks that compare favourably with the ubiquitous (enhanced) fat-tree data centre networks in terms of the number of servers within (given a fixed server-to-server diameter). Unfortunately there were flaws in some of the proofs in that paper. We correct these flaws here and extend the results so as to prove that the core combinatorial construction, namely the 3-step construction, results in data centre networks with optimal path diversity.

Citation

Stewart, I. (2015, August). On the mathematics of data centre network topologies. Presented at 20th International Symposium on Fundamentals of Computation Theory, Gdańsk, Poland

• Presentation Conference Type: Conference Paper (published)
• Conference Name: 20th International Symposium on Fundamentals of Computation Theory
• Start Date: Aug 17, 2015
• End Date: Aug 19, 2015
• Acceptance Date: Jun 19, 2015
• Online Publication Date: Aug 4, 2015
• Publication Date: Aug 4, 2015
• Deposit Date: Jun 19, 2015
• Publicly Available Date: Mar 8, 2017
• Print ISSN: 0302-9743
• Pages: 283-295
• Series Title: Lecture notes in computer science
• Series Number: 9210
• Series ISSN: 0302-9743,1611-3349
• Book Title: Fundamentals of computation theory : 20th international symposium, FCT 2015, Gdańsk, Poland, August 17 - 19, 2015 ; proceedings.
• ISBN: 9783319221762
• DOI: https://doi.org/10.1007/978-3-319-22177-9_22
• Public URL: https://durham-repository.worktribe.com/output/1153843