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

胖树网络的随机负载均衡路由

Randomized Load-balanced Routing for Fat-tree Networks

Suzhen Wang, Jingjing Luo, Bruce Kwong-Bun Tong, Wing S. Wong

摘要:

胖树网络已被广泛采用的高性能计算(HPC)集群和数据中心网络(DCN)。这些并行系统通常具有大量的服务器和主机,这会产生大量的高波动性流量。因此,分布式负载平衡路由设计成为实现高带宽利用率和低延迟数据包传输的关键。现有的分布式设计依赖于远程拥塞反馈来解决拥塞,这增加了收集和响应网络范围的拥塞信息的开销。相比之下,我们提出了一个简单而有效的负载平衡方案,称为动态随机负载平衡(DRB),通过本地链路调整,这是免费的交换机之间的通信和合作,以实现网络范围内的低水平的路径冲突。首先,我们使用D-mod-k路径选择方案为胖树网络中的所有源-目的地(S-D)对分配默认路径,保证任何一组活动S-D对的下行链路上的低水平路径冲突。然后,我们提出了基于双选择(TTC)的随机化技术,通过在每个交换机本地上行链路调整来平衡上行链路流量。我们从理论上表明,建议TTC的胖树网络中的上行链路负载均衡有一个类似的性能作为两个选择技术在该地区的随机负载均衡。仿真结果表明,在胖树网络中,采用TTC技术的DRB比许多随机路由方案都有明显的改善。

英文摘要:

Fat-tree networks have been widely adopted to High Performance Computing (HPC) clusters and to Data Center Networks (DCN). These parallel systems usually have a large number of servers and hosts, which generate large volumes of highly-volatile traffic. Thus, distributed load-balancing routing design becomes critical to achieve high bandwidth utilization, and low-latency packet delivery. Existing distributed designs rely on remote congestion feedbacks to address congestion, which add overheads to collect and react to network-wide congestion information. In contrast, we propose a simple but effective load-balancing scheme, called Dynamic Randomized load-Balancing (DRB), to achieve network-wide low levels of path collisions through local-link adjustment which is free of communications and cooperations between switches. First, we use D-mod-k path selection scheme to allocate default paths to all source-destination (S-D) pairs in a fat-tree network, guaranteeing low levels of path collision over downlinks for any set of active S-D pairs. Then, we propose Threshold-based Two-Choice (TTC) randomized technique to balance uplink traffic through local uplink adjustment at each switch. We theoretically show that the proposed TTC for the uplink-load balancing in a fat-tree network have a similar performance as the two-choice technique in the area of randomized load balancing. Simulation results show that DRB with TTC technique achieves a significant improvement over many randomized routing schemes for fat-tree networks.

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

↑