A Tale of Two Topologies
Authors:
Open Access
- 7 August 2017
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 295-308
Abstract
This paper promotes convertible data center network architectures, which can dynamically change the network topology to combine the benefits of multiple architectures. We propose the flat-tree prototype architecture as the first step to realize this concept. Flat-tree can be implemented as a Clos network and later be converted to approximate random graphs of different sizes, thus achieving both Clos-like implementation simplicity and random-graph-like transmission performance. We present the detailed design for the network architecture and the control system. Simulations using real data center traffic traces show that flat-tree is able to optimize various workloads with different topology options. We implement an example flat-tree network on a 20-switch 24-server testbed. The traffic reaches the maximal throughput in 2.5s after a topology change, proving the feasibility of converting topology at run time. The network core bandwidth is increased by 27.6% just by converting the topology from Clos to approximate random graph. This improvement can be translated into acceleration of applications as we observe reduced communication time in Spark and Hadoop jobs.Keywords
Funding Information
- National Science Foundation (CNS-1305379,CNS-1422925)
This publication has 31 references indexed in Scilit:
- Towards a flexible data center fabric with source routing2015
- WaveCube: A scalable, fault-tolerant, high-performance optical data center architecture2015
- FireFly2014
- Surviving failures in bandwidth-constrained datacenters2012
- Augmenting data center networks with multi-gigabit wireless links2011
- Symbiotic routing in future data centers2010
- Understanding data center traffic characteristicsACM SIGCOMM Computer Communication Review, 2010
- The nature of data center traffic2009
- Dcell2008
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithmsJournal of the ACM, 1999