A polynomial-time routing heuristic that chooses paths by minimizing an edge-decomposable upper bound on worst-case flow completion time improves mean and tail FCT by 1.5x and 2x in simulations.
On minimizing the completion times of long flows over inter-datacenter wan,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.NI 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Optimizing Inter-Datacenter Tail Flow Completion Times using Best Worst-case Routing
A polynomial-time routing heuristic that chooses paths by minimizing an edge-decomposable upper bound on worst-case flow completion time improves mean and tail FCT by 1.5x and 2x in simulations.