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:

Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge-isoperimetric problems in graphs.

Erickson, A. and Navaridas, J. and Stewart, I.A. (2020) 'Relating the bisection width of dual-port, server-centric datacenter networks and the solution of edge-isoperimetric problems in graphs.', Journal of computer and system sciences., 108 . pp. 10-28.

Abstract

Stellar datacenter networks are a recent generic construction designed to transform a base-graph into a dual-port, server-centric datacenter network. We prove that the S-bisection width of any stellar datacenter network can be obtained from the solution of isoperimetric problems on the base-graph, provided that the base-graph is regular. We extend previous research on the stellar datacenter networks GQ⁎, instantiated with generalized hypercubes, and show that with respect to S-bisection width, GQ⁎ performs well in comparison with the dual-port datacenter network FiConn. Our work develops a strong combinatorial link between graph bisection width and throughput metrics for stellar datacenter networks.

Item Type:Article
Full text:(VoR) Version of Record
Available under License - Creative Commons Attribution.
Download PDF
(1159Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1016/j.jcss.2019.08.005
Publisher statement:© 2019 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license. (http://creativecommons.org/licenses/by/4.0/)
Date accepted:15 August 2019
Date deposited:22 November 2019
Date of first online publication:27 August 2019
Date first made open access:22 November 2019

Save or Share this output

Export:
Export
Look up in GoogleScholar