Abstract

The theory of combinatorial designs has recently been used in order to build switch-centric data centre networks incorporating a large number of servers, in comparison with the popular Fat-Tree data centre network. We clarify and extend these results and prove that in these data centre networks: there are pairwise link-disjoint paths joining all the servers adjacent to some switch with all the servers adjacent to any other switch; and there are pairwise link-disjoint paths from all the servers adjacent to some switch to any identically-sized collection of target servers where these target servers need not be adjacent to the same switch. In both cases, we always control the path lengths. Our constructions and analysis are undertaken on bipartite graphs with the applications to data centre networks being easily derived. Our results show the potential of the application of results and methodologies from combinatorics to data centre network design.

Highlights

  • After explaining how hypergraphs and transversal designs can all be considered as bipartite graphs in Section 2, in Section 3 we provide a detailed description of the 3-step framework from [10] and explain how the bipartite graphs constructed are converted into switch-centric data centre network (DCN)

  • We have shown how combinatorial design theory can be used to build switch-centric DCNs of diameter at most 6 and with many more servernodes than the Fat-Tree DCN but so that there is still considerable one-to-one and one-to-many path diversity

  • We regard the more general demonstration that combinatorial mathematics can enhance the design of modern-day computational infrastructures such as data centres as one of the primary contributions of this paper

Read more

Summary

The data centre network context

Data centres are expanding both in terms of their size and their importance as computational platforms for cloud computing, web search, social networking, and so on. Server-centric DCNs suffer from deficiencies such as packet relay overheads caused by the need to route packets within the server; server-centric DCNs have yet to make it into the commercial mainstream (the reader is referred to [7] for an overview of the state of the art as regards DCN architectural design). It is with the construction of switch-centric DCNs that we are concerned here. The upshot is that the DCN designer has to simultaneously secure a number of performance characteristics, some of which are competing against each other; this makes the DCN design space complex and difficult to work in

Using combinatorial designs to build DCNs
Our contribution
Basic Concepts
Switch-centric DCNs
Hypergraphs
Hypergraphs and bipartite graphs
Paths in hypergraphs
Hypergraphs as switch-centric DCNs
The 3-step Construction and its Extensions
The 3-step construction
Composition
Some illustrations of DCNs
One-to-one path diversity
Difficulties with proofs
The one-to-one scenario
B2 B3 B4
Applying our construction
One-to-many path diversity
Conclusion
Full Text
Published version (Free)

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