A polynomial-time algorithm for unsplittable flow routing in Clos networks guarantees congestion at most 9/5 of optimal, with lower bounds of 3/2 offline and 2 online.
Network Traffic Characteristics of Data Centers in the Wild
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
A polynomial-time algorithm for unsplittable flow routing in Clos networks guarantees congestion at most 9/5 of optimal, with lower bounds of 3/2 offline and 2 online.