Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

On the combinatorial design of data centre network topologies.

Stewart, I.A. (2017) 'On the combinatorial design of data centre network topologies.', Journal of computer and system sciences., 89 . pp. 328-348.

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.

Item Type:Article
Full text:(AM) Accepted Manuscript
Available under License - Creative Commons Attribution.
Download PDF
(356Kb)
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
(735Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1016/j.jcss.2017.05.015
Publisher statement:© 2017 The Author(s). Published by Elsevier Inc. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Date accepted:03 June 2017
Date deposited:07 June 2017
Date of first online publication:13 June 2017
Date first made open access:15 August 2017

Save or Share this output

Export:
Export
Look up in GoogleScholar