For sparse traffic with k pairs in an N x N torus, the minimal worst-case load achievable by any oblivious routing is approximately sqrt(2k)/4, with a new scheme attaining this bound and outperforming Valiant load balancing.
1/2(r1 +r 2)fraction of traffic needs to be aggregated from each node inS r1,r2(t)
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
-
Optimal Oblivious Load-Balancing for Sparse Traffic in Large-Scale Satellite Networks
For sparse traffic with k pairs in an N x N torus, the minimal worst-case load achievable by any oblivious routing is approximately sqrt(2k)/4, with a new scheme attaining this bound and outperforming Valiant load balancing.