Publication details for Professor Iain StewartStewart, I.A. (2015), On the mathematics of data centre network topologies, in Kosowski, A. & Walukiewicz, I. eds, Lecture Notes in Computer Science 9210: 20th International Symposium on Fundamentals of Computation Theory. Gdańsk, Poland, Springer, Cham, 283-295.
- Publication type: Conference Paper
- ISSN/ISBN: 9783319221762, 9783319221779, 0302-9743
- DOI: 10.1007/978-3-319-22177-9_22
- Further publication details on publisher web site
- Durham Research Online (DRO) - may include full text
Author(s) from Durham
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.