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 mathematics of data centre network topologies.

Stewart, I.A. (2015) 'On the mathematics of data centre network topologies.', in Fundamentals of computation theory : 20th international symposium, FCT 2015, Gdańsk, Poland, August 17 - 19, 2015 ; proceedings. Cham: Springer, pp. 283-295. Lecture notes in computer science. (9210).


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.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
Publisher Web site:
Publisher statement:The final publication is available at Springer via
Date accepted:19 June 2015
Date deposited:08 March 2017
Date of first online publication:04 August 2015
Date first made open access:No date available

Save or Share this output

Look up in GoogleScholar