On the Mathematics of Data Centre Network Topologies
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.
- 2.Bermond, J.C., Bond, J., Djelloul, S.: Dense bus networks of diameter 2. In: Proceedings of the Workshop on Interconnection Networks. DIMACS Series vol. 21, pp. 9–18 (1995)Google Scholar
- 4.Liu, Y., Muppala, J.K., Veeraraghavan, M., Lin, D., Katz, J.: Data Centre Networks: Topologies, Architectures and Fault-Tolerance Characteristics. Springer, Heidelberg (2013)Google Scholar
- 6.Qu, G., Fang, Z., Zhang, J., Zheng, S.-Q.: Switch-centric data center network structures based on hypergraphs and combinatorial block designs. IEEE Trans. on Par. Distrib. Sys. 26(4), 154–1164 (2015)Google Scholar