arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1309.7066cs.NI
收藏

高吞吐量数据中心拓扑设计

High Throughput Data Center Topology Design

Ankit Singla, P. Brighten Godfrey, Alexandra Kolla

摘要:

随着高吞吐量网络在支持数据密集型应用中扮演关键角色,已经提出了各种数据中心网络拓扑以低成本实现高容量。虽然这篇文献探讨了大量的设计点,即使是在有限的情况下,网络的相同开关,没有任何建议已经能够要求任何概念的最优性。异构网络的情况下,合并多个线速度和端口数随着数据中心的增长随着时间的推移,引入了更大的复杂性。在本文中,我们提出了第一个非平凡的上界网络吞吐量均匀的交通模式下的任何拓扑结构相同的开关。然后,我们表明,随机图实现的吞吐量惊人地接近这个界限,在几千台服务器的规模在百分之几。除了证明同构拓扑设计可能达到其极限之外,这一结果还激励我们使用随机图作为构建块来探索异构网络的设计。给出了一个异构的网络交换机池,通过实验和分析,我们探讨了服务器在交换机上的分布和交换机之间的互连如何影响网络吞吐量。我们将这些见解应用于现实世界的异构数据中心拓扑结构VL2,在相同的设备下,吞吐量提高了43%。

英文摘要:

With high throughput networks acquiring a crucial role in supporting data-intensive applications, a variety of data center network topologies have been proposed to achieve high capacity at low cost. While this literature explores a large number of design points, even in the limited case of a network of identical switches, no proposal has been able to claim any notion of optimality. The case of heterogeneous networks, incorporating multiple line-speeds and port-counts as data centers grow over time, introduces even greater complexity. In this paper, we present the first non-trivial upper-bound on network throughput under uniform traffic patterns for any topology with identical switches. We then show that random graphs achieve throughput surprisingly close to this bound, within a few percent at the scale of a few thousand servers. Apart from demonstrating that homogeneous topology design may be reaching its limits, this result also motivates our use of random graphs as building blocks to explore the design of heterogeneous networks. Given a heterogeneous pool of network switches, through experiments and analysis, we explore how the distribution of servers across switches and the interconnection of switches affect network throughput. We apply these insights to a real-world heterogeneous data center topology, VL2, demonstrating as much as 43% higher throughput with the same equipment.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑