Jellyfish: Networking data centers randomly

Ankit Singla, Chi Yao Hong, Lucian Popa, P. Brighten Godfrey

Research output: Contribution to conferencePaper

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, 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.

Original languageEnglish (US)
Pages225-238
Number of pages14
StatePublished - Jan 1 2012
Event9th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2012 - San Jose, United States
Duration: Apr 25 2012Apr 27 2012

Conference

Conference9th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2012
CountryUnited States
CitySan Jose
Period4/25/124/27/12

    Fingerprint

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Singla, A., Hong, C. Y., Popa, L., & Godfrey, P. B. (2012). Jellyfish: Networking data centers randomly. 225-238. Paper presented at 9th USENIX Symposium on Networked Systems Design and Implementation, NSDI 2012, San Jose, United States.