Expanding into Reality: Random Graphs for Datacenter Networks

📅 2026-04-16
📈 Citations: 0
Influential: 0
📄 PDF

career value

214K/year
🤖 AI Summary
Traditional data center networks struggle to balance cost and fault tolerance, while random graph topologies have long remained impractical due to the lack of scalable routing and cabling solutions. This work presents RNG, the first successful deployment of a random graph–based architecture in large-scale production environments. RNG introduces a novel distributed routing protocol that supports a large number of edge-disjoint paths and leverages passive optical components to implement endpoint shuffling, significantly simplifying cabling complexity. Under diverse traffic patterns, RNG matches or exceeds the performance of fat-tree topologies while reducing deployment costs by up to 45%. It has since become the default data center network architecture for the majority of Amazon’s workloads.

Technology Category

Application Category

📝 Abstract
We design and deploy at Amazon the first production datacenter fabrics based on random graphs. While the cost and fault-tolerance benefits of such topologies have been long known, their practical realization has been hampered by a lack of scalable routing and cabling approaches. Our design, called RNG, has a new distributed routing protocol that exploits the properties of random graphs to find a large number of edge disjoint paths between endpoint pairs. A novel passive optical device that internally shuffles cable endpoints makes Amazon's cabling complexity similar to that of fat trees. We show that RNG fabrics match or exceed the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. At Amazon, we made RNG the default datacenter fabric for most workloads.
Problem

Research questions and friction points this paper is trying to address.

random graphs
datacenter networks
routing
cabling complexity
network topology
Innovation

Methods, ideas, or system contributions that make the work stand out.

random graphs
datacenter networks
distributed routing protocol
passive optical device
fault tolerance
🔎 Similar Papers
No similar papers found.
Giacomo Bernardi
Giacomo Bernardi
UC Santa Cruz Ecology and Evolutionary Biology; UC Santa Cruz Genomics Institute
Fish Molecular EcologySpeciationPhylogeographyPopulation genomics
Ratul Mahajan
Ratul Mahajan
University of Washington
Computer systems and networks
C. Seshadhri
C. Seshadhri
University of California, Santa Cruz
Theoretical computer sciencealgorithmssocial networks
E
Enrico Carlesso
Amazon Web Services
C
Chinchu Merine Joseph
Amazon Web Services
S
Saurabh Kumar
Amazon Web Services
P
Pavan Manikonda
Amazon Web Services
L
Luiza Popa
Amazon Web Services
R
Randy Ram
Amazon Web Services
S
Steven Robinson
Amazon Web Services
E
Elizabeth Tennent
Amazon Web Services