Relating the Bisection Width of Dual-Port, Server-Centric Datacenter Networks and the Solution of Edge Isoperimetric Problems in Graphs

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.