Paper Info
Title
Flat-tree: A Convertible Data Center Network Architecture from Clos to Random Graph.
Abstract
Clos networks are easy to implement, whereas random graphs have good performance. We propose flat-tree, a convertible data center network architecture, to combine the best of both worlds. Flat-tree can change the network topology dynamically, so the data center can be implemented as a Clos network and be converted to approximate random graphs of different sizes. To serve the heterogeneous workloads in data centers, flat-tree can organize the network as functionally separate zones each having a different topology. Workloads are placed into suitable zones that best optimize the performance. Simulation results demonstrate that flat-tree has similar performance to random graphs.
Year
DOI
Venue
2016
10.1145/3005745.3005763
HotNets
Keywords
Field
DocType
Convertible data center, Clos networks, Random graph
Random graph,Convertible,Clos network,Computer science,Network architecture,Computer network,Network topology,Data center,Distributed computing
Conference
Citations 
PageRank 
References 
4
0.40
22
Authors
2
Name
Order
Citations
PageRank
Yiting Xia1575.98
T. S. Eugene Ng22491274.31