Throughput Analysis of Jellyfish Network Variations

• March 3, 2020

This was a multi-step project for my Network Algorithms class. We started the beginning the semester by coding out a program to simulate ECMP routing over graphs. Then we had to design programs to generate graphs that could be read into the routing program. The traffic matrices imitated random permutation and all-to-all routing, so some traffic data had over 44,000 directions!

The results showed that Bipartite Jellyfish graphs can outperform Random Jellyfish topologies at low loads, while still performing nearly as well with heavier traffic.

One of the hardest parts about this project was taking written descriptions of traffic matrices and ECMP routing and implementing them in code.