Jellyfish: Networking data centers randomly

A Singla, CY Hong, L Popa, PB Godfrey - 9th USENIX Symposium on …, 2012 - usenix.org
9th USENIX Symposium on Networked Systems Design and Implementation (NSDI 12), 2012usenix.org
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 …
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.
usenix.org
Showing the best result for this search. See all results