Skip to main content

Research Repository

Advanced Search

On the combinatorial design of data centre network topologies

Stewart, I.A.

On the combinatorial design of data centre network topologies Thumbnail


Authors



Abstract

The theory of combinatorial designs has recently been used in order to build switch-centric data centre networks incorporating a large number of servers, in comparison with the popular Fat-Tree data centre network. We clarify and extend these results and prove that in these data centre networks: there are pairwise link-disjoint paths joining all the servers adjacent to some switch with all the servers adjacent to any other switch; and there are pairwise link-disjoint paths from all the servers adjacent to some switch to any identically-sized collection of target servers where these target servers need not be adjacent to the same switch. In both cases, we always control the path lengths. Our constructions and analysis are undertaken on bipartite graphs with the applications to data centre networks being easily derived. Our results show the potential of the application of results and methodologies from combinatorics to data centre network design.

Citation

Stewart, I. (2017). On the combinatorial design of data centre network topologies. Journal of Computer and System Sciences, 89, 328-348. https://doi.org/10.1016/j.jcss.2017.05.015

Journal Article Type Article
Acceptance Date Jun 3, 2017
Online Publication Date Jun 13, 2017
Publication Date Nov 1, 2017
Deposit Date Jun 3, 2017
Publicly Available Date Mar 29, 2024
Journal Journal of Computer and System Sciences
Print ISSN 0022-0000
Publisher Elsevier
Peer Reviewed Peer Reviewed
Volume 89
Pages 328-348
DOI https://doi.org/10.1016/j.jcss.2017.05.015
Related Public URLs http://community.dur.ac.uk/i.a.stewart/Papers/MathsOfDCNsACCEPTED.pdf

Files






You might also like



Downloadable Citations