RNG: Flat Datacenter Networks at Scale
Abstract
We design and deploy in production the first flat datacenter networks. Our design, called RNG, is based on quasi-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. RNG has a new distributed routing protocol that exploits the properties of random graphs to find a large number of edge disjoint paths between pairs of endpoints. It uses a novel passive optical device that internally shuffles cables, which makes its cabling complexity similar to that of fat trees. We show that RNG matches or exceeds the performance of fat trees for a range of traffic patterns, despite being up to 45% cheaper. RNG is now the default datacenter network for most workloads at Amazon.
Cite
@article{arxiv.2604.15261,
title = {RNG: Flat Datacenter Networks at Scale},
author = {Giacomo Bernardi and Ratul Mahajan and C. Seshadhri and Enrico Carlesso and Chinchu Merine Joseph and Saurabh Kumar and Pavan Manikonda and Luiza Popa and Randy Ram and Steven Robinson and Elizabeth Tennent},
journal= {arXiv preprint arXiv:2604.15261},
year = {2026}
}