High-Performance Routing With Multipathing and Path Diversity in Ethernet and HPC Networks
Maciej Besta,Jens Domke,Marcel Schneider,Marek Konieczny,Salvatore Di Girolamo,Timo Schneider,Ankit Singla,Torsten Hoefler +7 more
Reads0
Chats0
TLDR
In this article, a taxonomy of different forms of support for multipathing and overall path diversity is presented, and the authors analyze how existing routing schemes support this diversity and propose new routing protocols to facilitate high-performance routing in modern networks.Abstract:
The recent line of research into topology design focuses on lowering network diameter. Many low-diameter topologies such as Slim Fly or Jellyfish that substantially reduce cost, power consumption, and latency have been proposed. A key challenge in realizing the benefits of these topologies is routing . On one hand, these networks provide shorter path lengths than established topologies such as Clos or torus, leading to performance improvements. On the other hand, the number of shortest paths between each pair of endpoints is much smaller than in Clos, but there is a large number of non-minimal paths between router pairs. This hampers or even makes it impossible to use established multipath routing schemes such as ECMP. In this article, to facilitate high-performance routing in modern networks, we analyze existing routing protocols and architectures, focusing on how well they exploit the diversity of minimal and non-minimal paths. We first develop a taxonomy of different forms of support for multipathing and overall path diversity. Then, we analyze how existing routing schemes support this diversity. Among others, we consider multipathing with both shortest and non-shortest paths, support for disjoint paths, or enabling adaptivity. To address the ongoing convergence of HPC and “Big Data” domains, we consider routing protocols developed for both HPC systems and for data centers as well as general clusters. Thus, we cover architectures and protocols based on Ethernet, InfiniBand, and other HPC networks such as Myrinet. Our review will foster developing future high-performance multipathing routing protocols in supercomputers and data centers.read more
Citations
More filters
Posted Content
Scaling betweenness centrality using communication-efficient sparse matrix multiplication
TL;DR: A succinct BC algorithm based on novel sparse matrix multiplication routines that performs a factor of p1/3 less communication on p processors than the best known alternatives, for graphs with n vertices and average degree k = n/p2/3.
Posted Content
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
TL;DR: This work provides the first analysis and taxonomy of dynamic and streaming graph processing, focusing on identifying the fundamental system designs and on understanding their support for concurrency, and for different graph updates as well as analytics workloads.
Megafly: A Topology for Exascale Systems.
TL;DR: In this article, the authors explore network topologies suitable for future exascale systems that need to support over fifty thousand endpoints and identify two cost efficient hierarchical topologies, one a canonical Dragonfly, and one a variant of the Dragonfly topology that they call Megafly.
Journal ArticleDOI
Practice of Streaming Processing of Dynamic Graphs: Concepts, Models, and Systems
TL;DR: In this article , a taxonomy of dynamic and streaming graph processing frameworks is presented, focusing on identifying the fundamental system designs and on understanding their support for concurrency, and for different graph updates as well as analytics workloads.
Journal ArticleDOI
LEO Satellite Networks: When Do All Shortest Distance Paths Belong to Minimum Hop Path Set?
TL;DR: Based on the topological regularity and link distance variation patterns, the authors proves several simplified equivalent propositions and derives a discriminant function to judge if the proposition holds in an arbitrary constellation.
References
More filters
Journal ArticleDOI
OpenFlow: enabling innovation in campus networks
Nick McKeown,Thomas Anderson,Hari Balakrishnan,Guru Parulkar,Larry L. Peterson,Jennifer Rexford,Scott Shenker,Jonathan S. Turner +7 more
TL;DR: This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day, based on an Ethernet switch, with an internal flow-table, and a standardized interface to add and remove flow entries.
Journal ArticleDOI
Algorithm 97: Shortest path
TL;DR: The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
Journal ArticleDOI
A scalable, commodity data center network architecture
TL;DR: This paper shows how to leverage largely commodity Ethernet switches to support the full aggregate bandwidth of clusters consisting of tens of thousands of elements and argues that appropriately architected and interconnected commodity switches may deliver more performance at less cost than available from today's higher-end solutions.
Multiprotocol Label Switching Architecture
TL;DR: This document specifies the architecture for Multiprotocol Label Switching (MPLS).
Book
Principles and Practices of Interconnection Networks
William J. Dally,Brian Towles +1 more
TL;DR: This book offers a detailed and comprehensive presentation of the basic principles of interconnection network design, clearly illustrating them with numerous examples, chapter exercises, and case studies, allowing a designer to see all the steps of the process from abstract design to concrete implementation.