Starfish: A Topology-Routing Co-Design for Small-Scale Data Centers
summary
Starfish rearranges existing switches into a DRing double‑ring topology and implements a Shortest Near K routing scheme using VRF partitions and BGP (prototype in GNS3), evaluated with an HTSim packet‑level simulator. Without new hardware it supports 56% more traffic than leaf‑spine, enables Jellyfish to gain 52%, and beats VLB by 26% on traces. Supports oblivious and semi‑oblivious weight assignment and withstands random link failures with worst slowdown ≈1.37.
AI-written summary · about
chapters (8)
- 0:00Starfish introduction and goals
- 2:50Small-scale DC design challenges
- 6:20Resolving the trilemma
- 7:04Starfish topology: D-ring
- 9:13Starfish routing: Shortest Near K
- 13:13Weight assignment and traffic
- 14:36Starfish performance evaluation
- 17:52Conclusion and future
related talks
32mLeveraging open source dynamic routing to implement a spine/leaf in datacenter
25mStardust: Divide and Conquer in the Data Center Network
20mContra: A Programmable System for Performance aware Routing
13mEfficient Navigation for Modern Networks
14mRDC: Energy-Efficient Data Center Network Congestion Relief with Topological
26mF10: A Fault-Tolerant Engineered Network
22mUnderstanding Lifecycle Management Complexity of Datacenter Topologies
21mLarry: Practical Network Reconfigurability in the Data Center
