R.I.P.
๐ป
Ghosted
Expanding into Reality: Random Graphs for Datacenter Networks
April 16, 2026 ยท Grace Period ยท + Add venue
Authors
Giacomo Bernardi, Ratul Mahajan, C. Seshadhri, Enrico Carlesso, Chinchu Merine Joseph, Saurabh Kumar, Pavan Manikonda, Luiza Popa, Randy Ram, Steven Robinson, Elizabeth Tennent
arXiv ID
2604.15261
Category
cs.NI: Networking & Internet
Citations
0
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Networking & Internet
๐
๐
The Cartographer
Federated Learning in Mobile Edge Networks: A Comprehensive Survey
๐
๐
The Cartographer
A Survey of Indoor Localization Systems and Technologies
R.I.P.
๐ป
Ghosted
Survey of Important Issues in UAV Communication Networks
๐
๐
The Cartographer
Network Function Virtualization: State-of-the-art and Research Challenges
๐
๐
The Cartographer