Expander Datacenters: From Theory to Practice

11/01/2018
by   Vipul Harsh, et al.
0

Recent work has shown that expander-based data center topologies are robust and can yield superior performance over Clos topologies. However, to achieve these benefits, previous proposals use routing and transport schemes that impede quick industry adoption. In this paper, we examine if expanders can be effective for the technology and environments practical in today's data centers, including the use of traditional protocols, at both small and large scale while complying with common practices such as over-subscription. We study bandwidth, latency and burst tolerance of topologies, highlighting pitfalls of previous topology comparisons. We consider several other metrics of interest: packet loss during failures, queue occupancy and topology degradation. Our experiments show that expanders can realize 3x more throughput than an equivalent fat tree, and 1.5x more throughput than an equivalent leaf-spine topology, for a wide range of scenarios, with only traditional protocols. We observe that expanders achieve lower flow completion times, are more resilient to bursty load conditions like incast and outcast and degrade more gracefully with increasing load. Our results are based on extensive simulations and experiments on a hardware testbed with realistic topologies and real traffic patterns.

READ FULL TEXT

page 5

page 6

page 10

research
09/30/2020

COUDER: Robust Topology Engineering for Optical Circuit Switched Data Center Networks

Many optical circuit switched data center networks (DCN) have been propo...
research
05/02/2022

Scalable Tail Latency Estimation for Data Center Networks

In this paper, we consider how to provide fast estimates of flow-level t...
research
06/26/2019

FatPaths: Routing in Supercomputers, Data Centers, and Clouds with Low-Diameter Networks when Shortest Paths Fall Short

We introduce FatPaths: a simple, generic, and robust routing architectur...
research
02/07/2022

Optimal Direct-Connect Topologies for Collective Communications

We consider the problem of distilling optimal network topologies for col...
research
09/09/2020

An Adaptive Flow-Aware Packet Scheduling Algorithm for Multipath Tunnelling

This paper proposes AFMT, a packet scheduling algorithm to achieve adapt...
research
07/08/2023

SDT: A Low-cost and Topology-reconfigurable Testbed for Network Research

Network experiments are essential to network-related scientific research...
research
02/27/2018

Elmo: Source-Routed Multicast for Cloud Services

Modern data-center applications frequently exhibit one-to-many communica...

Please sign up or login with your details

Forgot password? Click here to reset