English

Jellyfish: Networking Data Centers Randomly

Networking and Internet Architecture 2012-04-24 v3

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.

Keywords

Cite

@article{arxiv.1110.1687,
  title  = {Jellyfish: Networking Data Centers Randomly},
  author = {Ankit Singla and Chi-Yao Hong and Lucian Popa and P. Brighten Godfrey},
  journal= {arXiv preprint arXiv:1110.1687},
  year   = {2012}
}

Comments

14 pages, 12 figures

R2 v1 2026-06-21T19:17:09.829Z