Jellyfish Flashcards
a high-capacity network interconnect which, by adopting a random graph topology, yields itself
naturally to incremental expansion
Jellyfish
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
a degree-bounded2 random graph topology
among top-of-rack (ToR) switches. The inherently
sloppy nature of this design has the potential to
be significantly more flexible than past designs.
Jellyfish
can support 25% more servers than a fattree
while using the same switch equipment and
providing at least as high bandwidth. This advantage
increases with network size and switch portcount.
Jellyfish
The Jellyfish approach is to construct a
random graph at the top-of-rack (ToR) switch layer. Each ToR switch i has some number ki of ports, of which it uses ri to connect to other ToR switches, and uses the remaining ki ..ri ports for servers.
Jellyfish Topology
In this case, the network is a random
regular graph, which we denote as RRG(N, k, r).
two key goals of Jellyfish
high bandwidth and
flexibility
have high throughput because they have low average path length, and therefore do less work to deliver
each packet.
Random graphs
a common measure of network capacity, is the
worst-case bandwidth spanning any two equal-size partitions of a network
Bisection bandwidth,
allows for heterogeneous expansion
Jellyfish
substantially more cost-effective than LEGUP’s Clos network expansion. With the same budget for equipment and rewiring at each expansion stage (x-axis), Jellyfish obtains significantly higher bisection bandwidth (y-axis). Results are averaged over 10 runs
Jellyfish’s incremental expansion
highly resilient to failures:
Jellyfish
(Jellyfish topology is even more
resilient than the same-equipment fat-tree (which itself
is no weakling))
performs poorly for Jellyfish,
not providing enough path diversity.
ECMP (equal cost multipath routing)
exploits Jellyfish’s high capacity well
Simple k-shortest path forwarding with MPTCP
represent a novel approach to the significant problems of incremental and heterogeneous expansion, while enabling high capacity, short paths, and resilience to failures and miswirings.
random graphs (Jellyfish)