A new class of data center network structures

Fat trees are considered suitable structures for data center interconnection networking. Such structures are rigid, and hard to scale up and scale out. A good data center network structure should have high scalability, efficient switch utilization, and high reliability. In this paper we present a class of data center network structures based on hypergraph theory and combinatorial block design theory. We show that our data center network structures are more flexible and scalable than fat trees. Using switches of the same size, our data center network structures can connect more nodes than fat trees, and it is possible to construct different structures with trade-offs among inter-cluster communication capacity, reliability, the number of switches used, and the number of connected nodes.

[1]  Charles Delorme,et al.  Large bipartite graphs with given degree and diameter , 1985, J. Graph Theory.

[2]  Charles E. Leiserson,et al.  Fat-trees: Universal networks for hardware-efficient supercomputing , 1985, IEEE Transactions on Computers.

[3]  Lowell Campbell,et al.  Dense Group Networks , 1992, Discret. Appl. Math..

[4]  J.W. Moore,et al.  Small Diameter Symmetric Networks from Linear Groups , 1992, IEEE Trans. Computers.

[5]  Jean-Claude Bermond,et al.  Dense bus networks of diameter 2 , 1994, Interconnection Networks and Mapping and Scheduling Parallel Computations.

[6]  F. Comellas,et al.  New large graphs with given degree and diameter , 1994, math/9411218.

[7]  Si-Qing Zheng,et al.  An Abstract Model for Optical Interconnection Networks , 1998 .

[8]  Charles J. Colbourn,et al.  Combinatorial Designs , 1999, Handbook of Discrete and Combinatorial Mathematics.

[9]  Douglas R. Stinson,et al.  A combinatorial approach to key predistribution for distributed sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[10]  Amin Vahdat,et al.  A scalable, commodity data center network architecture , 2008, SIGCOMM '08.

[11]  Banshidhar Majhi,et al.  A Deterministic Approach of Merging of Blocks in Transversal Design based Key Predistribution , 2009, IACR Cryptol. ePrint Arch..