Flattened Clos: Designing High-performance Deadlock-free Expander Data Center Networks...
summary
Proposes a topology and routing codesign that logically splits each ToR into k virtual layers, builds only adjacent-layer links, generates virtual up‑down paths, and uses graph contraction to flatten them; provides a mathematical deadlock-free proof and validates it on a real testbed and packet‑level simulation. Claims at least 50% hop reduction vs EDST and 2–10× throughput improvement over EDST, plus 1.1–2× vs Clos, reports deadlocks from KSP forming in ~20 μs and a 4‑switch 64‑server test where 66% of RDMA connections break.
AI-written summary · about
chapters (11)
- 0:00Intro
- 0:32From Clos to Expander
- 1:26Is Expander an Reality?
- 2:13RDMA in Data Centers
- 4:18Current Practice and Challenges
- 6:24Virtual Up-Down Routing
- 7:49Number of Virtual Layers
- 9:40Cabling and Layout
- 11:30FC vs EDST
- 13:11FC vs Clos (Same Switch Count)
- 16:38Conclusion
related talks
23mMinimal Rewiring: Efficient Live Expansion for Clos Data Center Networks
22mUnderstanding Lifecycle Management Complexity of Datacenter Topologies
14mRDC: Energy-Efficient Data Center Network Congestion Relief with Topological
21mLarry: Practical Network Reconfigurability in the Data Center
22mAdapting TCP for Reconfigurable Datacenter Networks
22mExpanding across time to deliver bandwidth efficiency and low latency
19mStarfish: A Topology-Routing Co-Design for Small-Scale Data Centers
24mNetBlocks: Staging Layouts for High-Performance Custom Host Network Stacks