Paper Info
Title
A Tale of Two Topologies: Exploring Convertible Data Center Network Architectures with Flat-tree
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.
Year
DOI
Venue
2017
10.1145/3098822.3098837
SIGCOMM
Keywords
Field
DocType
Convertible data center networks,Clos networks,Random graph networks
Logical topology,Data center network architectures,Random graph,Computer science,Clos network,Network simulation,Network architecture,Computer network,Network topology,Throughput,Distributed computing
Conference
ISBN
Citations 
PageRank 
978-1-4503-4653-5
9
0.51
References 
Authors
29
6
Name
Order
Citations
PageRank
Yiting Xia1575.98
Xiaoye Sun2374.39
Simbarashe Dzinamarira3162.67
dingming wu4285.47
Xin Sunny Huang5242.81
T. S. Eugene Ng62491274.31