A Universal Approach to Data Center Network Design

This paper proposes an approach to the design of large-scale general-purpose data center networks based on the notions of volume and area universality introduced by Leiserson in the 1980's in the context of VLSI design. In particular, we suggest that the principle goal of the network designer should be to build a single network that is provably competitive, for any application, with any network that can be built for the same amount of money. After describing our approach, we survey the technology choices available to network designers today, and examine several existing commercial data center networks. In the most recent of these networks resources are allocated roughly as we suggest in this paper.

[1]  William J. Dally,et al.  Technology-Driven, Highly-Scalable Dragonfly Topology , 2008, 2008 International Symposium on Computer Architecture.

[2]  James C. Hoe,et al.  START-NG: Delivering Seamless Parallel Computing , 1995, Euro-Par.

[3]  Frank Thomson Leighton.  Introduction to parallel algorithms and architectures: arrays , 1992 .

[4]  Guy E. Blelloch,et al.  The hidden cost of low bandwidth communication , 1994 .

[5]  Alejandro López-Ortiz,et al.  LEGUP: using heterogeneity to reduce the cost of data center network upgrades , 2010, CoNEXT.

[6]  Ronald I. Greenberg,et al.  Efficient Interconnection Schemes for VLSI and Parallel Computation , 1989 .

[7]  Edward S. Davidson,et al.  Communication in the KSR1 MPP: performance evaluation using synthetic workload experiments , 1994, ICS '94.

[8]  M. Rem,et al.  Cost and performance of VLSI computing structures , 1979, IEEE Transactions on Electron Devices.

[9]  Ankit Singla,et al.  Jellyfish: Networking Data Centers Randomly , 2011, NSDI.

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

[11]  F. Leighton,et al.  Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes , 1991 .

[12]  Jon Beecroft,et al.  Meiko CS-2 Interconnect Elan-Elite Design , 1994, Parallel Comput..

[13]  Charles E. Leiserson,et al.  VLSI theory and parallel supercomputing , 1989 .

[14]  Bruce M. Maggs,et al.  Randomized Routing and Sorting on Fixed-Connection Networks , 1994, J. Algorithms.

[15]  Eli Upfal,et al.  An O(logN) deterministic packet routing scheme , 1989, STOC '89.

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

[17]  T. Bowers.  Blocking in 3-Stage "Folded" Switching Arrays , 1965 .

[18]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.

[19]  Bruce M. Maggs,et al.  On-Line Algorithms for Path Selection in a Nonblocking Network , 1996, SIAM J. Comput..

[20]  Bruce M. Maggs,et al.  Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks , 1992, IEEE Trans. Computers.

[21]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[22]  William J. Dally,et al.  The BlackWidow High-Radix Clos Network , 2006, 33rd International Symposium on Computer Architecture (ISCA'06).

[23]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[24]  Haitao Wu,et al.  BCube: a high performance, server-centric network architecture for modular data centers , 2009, SIGCOMM '09.

[25]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[26]  Bruce M. Maggs,et al.  A Parallel Algorithm for Reconfiguring a Multibutterfly Network with Faulty Switches , 1994, IEEE Trans. Computers.

[27]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[28]  Ronald I. Greenberg,et al.  Randomized Routing on Fat-Trees (Preliminary Version) , 1985, FOCS.

[29]  Lei Shi,et al.  Dcell: a scalable and fault-tolerant network structure for data centers , 2008, SIGCOMM '08.

[30]  Peter Kulchyski.  and , 2015 .

[31]  Eli Upfal,et al.  An O(log N) deterministic packet-routing scheme , 1992, JACM.

[32]  Amin Vahdat,et al.  PortLand: a scalable fault-tolerant layer 2 data center network fabric , 2009, SIGCOMM '09.

[33]  Paul Bay,et al.  An area-universal VLSI circuit , 1993 .