Demand-aware topologies achieve at least 5/8 asymptotic throughput in the worst case, separating from the demand-oblivious bound of n/(2n-1) ≈ 1/2; computing optimal weak throughput is NP-hard while direct throughput is polynomial-time solvable.
Helios: A hybrid electrical/optical switch architecture for modular data centers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Separation Between Optimal Demand-Oblivious and Demand-Aware Network Throughput
Demand-aware topologies achieve at least 5/8 asymptotic throughput in the worst case, separating from the demand-oblivious bound of n/(2n-1) ≈ 1/2; computing optimal weak throughput is NP-hard while direct throughput is polynomial-time solvable.