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.

恒星数据中心网络是最近的通用构造，旨在将基本图形转换为以服务器为中心的双端口数据中心网络。我们证明，只要底图是规则的，任何恒星数据中心网络的S-等分宽度都可以从底图上的等距问题的解中获得。我们延长恒星数据中心网络GQ以往的研究^⁎，与广义超立方体实例，并表明相对于小号-bisection宽度，GQ ^⁎以及与双端口的数据中心网络FiConn比较执行。我们的工作为星型数据中心网络开发了图形二等分宽度和吞吐量指标之间的强大组合链接。