Saved in:
| Main Authors: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2604.15261 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913151747883008 |
|---|---|
| author | Bernardi, Giacomo Mahajan, Ratul Seshadhri, C. Carlesso, Enrico Joseph, Chinchu Merine Kumar, Saurabh Manikonda, Pavan Popa, Luiza Ram, Randy Robinson, Steven Tennent, Elizabeth |
| author_facet | Bernardi, Giacomo Mahajan, Ratul Seshadhri, C. Carlesso, Enrico Joseph, Chinchu Merine Kumar, Saurabh Manikonda, Pavan Popa, Luiza Ram, Randy Robinson, Steven Tennent, Elizabeth |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2604_15261 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | RNG: Flat Datacenter Networks at Scale Bernardi, Giacomo Mahajan, Ratul Seshadhri, C. Carlesso, Enrico Joseph, Chinchu Merine Kumar, Saurabh Manikonda, Pavan Popa, Luiza Ram, Randy Robinson, Steven Tennent, Elizabeth Networking and Internet Architecture 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. |
| title | RNG: Flat Datacenter Networks at Scale |
| topic | Networking and Internet Architecture |
| url | https://arxiv.org/abs/2604.15261 |