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.

Highlights

  • The design of datacenter networks is becoming an important aspect of computing provision as software and infrastructure services increasingly migrate to the cloud

  • We argue that in this narrower context, the arguments of [25] do not carry so much weight and that bisection width, or more precisely the refinement S-bisection width, which we detail and justify here, and which is tailored for server-centric datacenter networks, is a relevant throughput metric

  • We show that this upper bound can be met with a hypercube as the base graph G; that is, the bisection width of G is equal to the S-bisection width of G∗

Read more

Summary

Introduction

The design of datacenter networks is becoming an important aspect of computing provision as software and infrastructure services increasingly migrate to the cloud. The actual networks themselves have evolved as computational demands have increased, and various new paradigms have emerged as regards the generation of datacenter networks. The resulting datacenter network Fat-Tree is a switch-centric datacenter network whereby all communication intelligence resides in the (high-end) switches. This is symptomatic of a general phenomenon: the vast amount of research on interconnection networks (designed for networks-on-chips, distributed-memory multiprocessors, clusters, and so on) provides a source of ideas for both datacenter network topologies and solutions of datacenter network design problems. (and germane to this paper), the differing demands and constraints of datacenter networks mean that these ideas are not always immediately applicable

Objectives
Results
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call