论文标题
水母网络上的多路由路由
Multi-Path Routing on the Jellyfish Networks
论文作者
论文摘要
最近已提出了水母网络作为数据中心和高性能计算群的互连的替代品。水母采用随机的常规图作为其拓扑结构，并且显示出比脂肪树更具成本效益。有效的水母路线具有挑战性。众所周知，最短的路径路由和相等的多路路线路由（ECMP）在水母上不能很好地工作。现有方案使用K-Shortest路径路由（KSP）的变化。在这项工作中，我们研究了水母的两个路由组件：选择路由路由流量路径的路径选择，以及确定每个数据包使用哪种路径的路由机制。我们表明，通过结合两个启发式方法，随机分配和边缘分散性，可以显着提高现有KSP的性能。我们评估了一系列路由机制，包括流量遗忘和交通自适应方案，并确定一种适应性路由方案，其性能明显高于其他包括通用全球自适应负载（UGAL）路由的其他方法。
The Jellyfish network has recently be proposed as an alternate to the fat-tree network as the interconnect for data centers and high performance computing clusters. Jellyfish adopts a random regular graph as its topology and has been showed to be more cost-effective than fat-trees. Effective routing on Jellyfish is challenging. It is known that shortest path routing and equal-cost multi-path routing (ECMP) do not work well on Jellyfish. Existing schemes use variations of k-shortest path routing (KSP). In this work, we study two routing components for Jellyfish: path selection that decides the paths to route traffic, and routing mechanisms that decide which path to be used for each packet. We show that the performance of the existing KSP can be significantly improved by incorporating two heuristics, randomization and edge-disjointness. We evaluate a range of routing mechanisms including traffic oblivious and traffic adaptive schemes and identify an adaptive routing scheme that has significantly higher performance than others including the Universal Globally Adaptive Load-balance (UGAL) routing.
