Jellyfish: Networking Data Centers Randomly

By Ankit Singla, C. Hong, L. Popa, Brighten Godfrey. Symposium on Networked Systems Design and Implementation, 2011

617 citations recorded by the source corpus.

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, supporting as many as 25% more servers at full capacity using the same equipment 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 approaches to resolve these challenges, and our evaluation suggests that Jellyfish could be deployed in today's data centers.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/5b8bcb3d2b8e2f4111c61003abbfbb5963187870

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Brighten Godfrey
  2. Costin Raiciu
  3. Vimalkumar Jeyakumar
  4. Nick McKeown
  5. Amin Vahdat
  6. Mark James Handley
  7. C. Hong
  8. Matthew C. Caesar

In Electrical and Electronic Engineering

  1. Torsten Hoefler
  2. Maciej Besta
  3. Brighten Godfrey
  4. Vyas Sekar
  5. Rodrigo Fonseca
  6. Amin Vahdat
  7. John C. Doyle
  8. Samir R Das

Citations in the corpus