"Ethernet on AIR': Scalable Routing in very Large Ethernet-Based Networks

Sampath, Dhananjay; Agarwal, Sonali; Garcia-Luna-Aceves, J.J.

doi:10.1109/icdcs.2010.82

Cited by 10 publications

(5 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…TRansparent Interconnection of Lots of Links (TRILL) [207] and Shortest Path Bridging (SPB) [13] are similar schemes that both rely on link state routing to, among others, enable multipathing based on multiple trees and ECMP. Ethernet on Air [184] uses the approach introduced by SEAT-TLE [131] to eliminate flooding in the switched network. They both rely on LIS and distributed hashtables (DHTs), implemented in switches, to map endpoints to the switches connecting these endpoints to the network.…”

Section: Ethernet and Tcp/ip (Clusters General Network)mentioning

confidence: 99%

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

Besta¹,

Domke²,

Schneider³

et al. 2020

Preprint

View full text Add to dashboard Cite

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 work, 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 traditional HPC systems and supercomputers, and for data centers and 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.

show abstract

Section: Ethernet and Tcp/ip (Clusters General Network)mentioning

confidence: 99%

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

Besta¹,

Domke²,

Schneider³

et al. 2020

Preprint

View full text Add to dashboard Cite

show abstract

“…DCell [57] L2-L3 ŏ ŏ ŏ ŏ ŏ ŏ Monsoon [54] L2, L3 Ŏ Ŏ ŏ Ŏ ŏ ŏ ŏ PortLand [104] L2 ŏ ŏ ŏ ŏ ŏ DRILL [49] L2 ŏ ŏ ŏ ŏ LocalFlow [127], DRB [28] L2 ŏ ŏ ŏ ŏ VL2 [53] L3 ŏ ŏ ŏ Ŏ ŏ Architecture by Al-Fares et al [7] L2-L3 ŏ ŏ ŏ BCube [55] L2-L3 ŏ ŏ ŏ ŏ SEATTLE [83], others * [47,94,108,122] L2 ŏ ŏ ŏ ŏ ŏ VIRO [69] L2-L3 ŏ S ŏ S ŏ ŏ ŏ ŏ Ethernet on Air [123] L2 ŏ S ŏ S ŏ Ŏ R ŏ ŏ PAST [132] L2 Ŏ S Ŏ S ŏ ŏ ŏ MLAG, MC-LAG, others [133] L2 Ŏ Ŏ ŏ Ŏ R ŏ ŏ MOOSE [124] L2 ŏ ŏ Ŏ ŏ ŏ MPA [103] L3 ŏ ŏ ŏ AMP [51] L3 ŏ ŏ ŏ MSTP [36], GOE [68], Viking [128] L2 ŏ S ŏ S ŏ ŏ ŏ SPB [13], TRILL [136], Shadow MACs [3] L2 ŏ R ŏ ŏ ŏ SPAIN [102] L2 Ŏ S Ŏ S Ŏ S ŏ…”

Section: Sp Np Sm Mp Dp Alb Atmentioning

confidence: 99%

FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short

Besta¹,

Schneider²,

Cynk³

et al. 2019

Preprint

View full text Add to dashboard Cite

We introduce FatPaths: a simple, generic, and robust routing architecture for Ethernet stacks. FatPaths enables state-of-the-art low-diameter topologies such as Slim Fly to achieve unprecedented performance, targeting both HPC supercomputers as well as data centers and clusters used by cloud computing. FatPaths exposes and exploits the rich ("fat") diversity of both minimal and non-minimal paths for high-performance multi-pathing. Moreover, FatPaths features a redesigned "purified" transport layer, based on recent advances in data center networking, that removes virtually all TCP performance issues (e.g., the slow start). FatPaths also uses flowlet switching, a technique used to prevent packet reordering in TCP networks, to enable very simple and effective load balancing. Our design enables recent low-diameter topologies to outperform powerful Clos designs, achieving 15% higher net throughput at 2× lower latency for comparable cost. FatPaths will significantly accelerate Ethernet clusters that form more than 50% of the Top500 list and it may become a standard routing scheme for modern topologies.

show abstract

“…OSPF) X X MLAG [29] X SPAIN [30] X X PortLand [33] X VL2 [14] X X X X SEATTLE [23] X TRILL [36] X X EthAir [37], VIRO [21] X PAST Table 1: Comparison of data center network architectures.…”

Section: Functional Requirementsmentioning

confidence: 99%

“…For example, PortLand [33] constrains the topology to a Fat Tree and assigns addresses based on each node's position in the tree, allowing for aggregation at each level. Virtual ID Routing [26] and Ethernet on Air [37] both build a tree and hierarchically assign addresses within the tree. While this approach works on arbitrary topologies, it does so by disabling some links and introducing paths that are up to a factor of two longer than necessary.…”

Section: Routing Design Spacementioning

confidence: 99%

See 1 more Smart Citation

Past

Stephens

Cox

Felter

et al. 2012

Proceedings of the 8th International Conference on Emerging Networking Experiments and Technologies

120

View full text Add to dashboard Cite

We present PAST, a novel network architecture for data center Ethernet networks that implements a Per-Address Spanning Tree routing algorithm. PAST preserves Ethernet's self-configuration and mobility support while increasing its scalability and usable bandwidth. PAST is explicitly designed to accommodate unmodified commodity hosts and Ethernet switch chips. Surprisingly, we find that PAST can achieve performance comparable to or greater than Equal-Cost Multipath (ECMP) forwarding, which is currently limited to layer-3 IP networks, without any multipath hardware support. In other words, the hardware and firmware changes proposed by emerging standards like TRILL are not required for highperformance, scalable Ethernet networks. We evaluate PAST on Fat Tree, HyperX, and Jellyfish topologies, and show that it is able to capitalize on the advantages each offers. We also describe an OpenFlow-based implementation of PAST in detail.

show abstract

"Ethernet on AIR': Scalable Routing in very Large Ethernet-Based Networks

Cited by 10 publications

References 10 publications

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

FatPaths: Routing in Supercomputers and Data Centers when Shortest Paths Fall Short

Past

Contact Info

Product

Resources

About