vix.ing · top · new · best · stats

Jellyfish: Networking Data Centers Randomly

2011/10/08 by Ankit Singla, Singla, Ankit, Chi-Yao Hong +5 · 2 voices · 8 citations
Computer Science · Engineering · #Advanced Optical Network Technologies #Interconnection Networks and Systems #Software-Defined Networks and 5G #cs.NI

paper · pdf · doi:10.48550/arxiv.1110.1687

14 pages, 12 figures

openalex publication_date 2011/10/08 · arxiv created 2012/04/20 · arxiv updated 2012/04/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

Industry experience indicates that the ability to incrementally expand data centers is essential. However, existing high-bandwidth network designs have rigid structure that interferes with incremental expansion. We present Jellyfish, a high-capacity network interconnect, which, by adopting a random graph topology, yields itself naturally to incremental expansion. Somewhat surprisingly, Jellyfish is more cost-efficient than a fat-tree: A Jellyfish interconnect built using the same equipment as a fat-tree, supports as many as 25% more servers at full capacity at the scale of a few thousand nodes, and this advantage improves with scale. Jellyfish also allows great flexibility in building networks with different degrees of oversubscription. However, Jellyfish's unstructured design brings new challenges in routing, physical layout, and wiring. We describe and evaluate approaches that resolve these challenges effectively, indicating that Jellyfish could be deployed in today's data centers.

Citations

Cited by

Discussions

Related