Journal of Communications · 2014 · 41 citations · 20 references
ComputingComputer ScienceComputer SystemsComputer NetworksEdge ComputingInterconnection NetworksFat-tree NetworksLatency OptimizationRoutingRouting AlgorithmsBandwidthData Center NetworkData Center Network ArchitectureData Center Network DesignData Center Network TopologyFat-tree TopologyMulti-path RoutingRouting Table Construction
With the widespread deployment of cloud services, data center networks are developing toward large-scale, multi- path networks. To support the new trend, some novel network architectures have been proposed, and Fat-tree is one of the most promising architecture and gets a lot of attention because it has good performance on aggregate bandwidth with a simple topology. This paper presents Diamond, an improved Fat-tree architecture for large-scale data centers. Diamond replaces all the aggregation switches of Fat-tree with edge switches and connects directly edge switches to core switches. By this alteration, the average route path and End-to-End (ETE) delay in Diamond are 10% less than that in Fat-tree. We design FAR, a simple and high-efficient routing method for Diamond. In FAR, each switch requires only hundreds of route entries to support a large-scale network with tens of thousands servers, and to build FAR routing tables, switches exchange very few messages. Diamond and its FAR routing are verified through OPNET simulations.
20
Albert Greenberg, James R. Hamilton, Navendu Jain et al. · 2009 · 2.1K citations
A scalable, commodity data center network architecture
Mohammad Al-Fares, Alexander Loukissas, Amin Vahdat · 2008 · 1.7K citations · Full text
Albert Greenberg, James R. Hamilton, David A. Maltz et al. · ACM SIGCOMM Computer Communication Review · 2008 · 1.6K citations · Full text
Chuanxiong Guo, Guohan Lu, Dan Li et al. · 2009 · 1.4K citations · Full text