arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.4697cs.NI
收藏

Space Shuffle:可扩展、灵活、高带宽的数据中心网络

Space Shuffle: A Scalable, Flexible, and High-Bandwidth Data Center Network

Ye Yu, Chen Qian

摘要:

数据中心应用要求网络具有可扩展性和丰富的带宽。当前的数据中心网络架构通常使用刚性拓扑来增加网络带宽。一个主要的限制是它们几乎不能支持增量网络增长。最近的工作提出使用随机互连来提供生长灵活性。然而,随机拓扑上的路由遭受控制和数据平面可扩展性问题,因为路由决策需要全局信息并且转发状态不能被聚合。在本文中,我们设计了一种新的灵活的数据中心网络架构,空间洗牌(S2),它适用于多个环形空间的贪婪路由,以实现高吞吐量,可扩展性和灵活性。建议贪婪路由协议的S2有效地利用了密集连接的拓扑结构的路径多样性,并使基于密钥的路由。大量的实验研究表明,S2提供了高的二等分带宽和吞吐量,接近最优的路由路径长度,极小的转发状态,并发数据流之间的公平性,以及对网络故障的弹性。

英文摘要:

Data center applications require the network to be scalable and bandwidth-rich. Current data center network architectures often use rigid topologies to increase network bandwidth. A major limitation is that they can hardly support incremental network growth. Recent work proposes to use random interconnects to provide growth flexibility. However routing on a random topology suffers from control and data plane scalability problems, because routing decisions require global information and forwarding state cannot be aggregated. In this paper we design a novel flexible data center network architecture, Space Shuffle (S2), which applies greedy routing on multiple ring spaces to achieve high-throughput, scalability, and flexibility. The proposed greedy routing protocol of S2 effectively exploits the path diversity of densely connected topologies and enables key-based routing. Extensive experimental studies show that S2 provides high bisectional bandwidth and throughput, near-optimal routing path lengths, extremely small forwarding state, fairness among concurrent data flows, and resiliency to network failures.

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

↑