[2604.15261] RNG: Flat Datacenter Networks at Scale

-->

Computer Science > Networking and Internet Architecture

arXiv:2604.15261 (cs)

[Submitted on 16 Apr 2026 (v1), last revised 21 May 2026 (this version, v3)]

Title:RNG: Flat Datacenter Networks at Scale

Authors:Giacomo Bernardi, Ratul Mahajan, C. Seshadhri, Enrico Carlesso, Chinchu Merine Joseph, Saurabh Kumar, Pavan Manikonda, Luiza Popa, Randy Ram, Steven Robinson, Elizabeth Tennent<br>View a PDF of the paper titled RNG: Flat Datacenter Networks at Scale, by Giacomo Bernardi and 10 other authors

View PDF<br>HTML (experimental)

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.

Subjects:

Networking and Internet Architecture (cs.NI)

Cite as:<br>arXiv:2604.15261 [cs.NI]

(or<br>arXiv:2604.15261v3 [cs.NI] for this version)

https://doi.org/10.48550/arXiv.2604.15261

Focus to learn more

arXiv-issued DOI via DataCite

Submission history<br>From: C. Seshadhri [view email]<br>[v1]<br>Thu, 16 Apr 2026 17:37:04 UTC (1,280 KB)

[v2]<br>Thu, 7 May 2026 18:34:53 UTC (1,248 KB)

[v3]<br>Thu, 21 May 2026 04:26:09 UTC (1,248 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled RNG: Flat Datacenter Networks at Scale, by Giacomo Bernardi and 10 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.NI

next >

new<br>recent<br>| 2026-04

Change to browse by:

cs

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)