Latency-Optimal Geo-Distributed Storage over Structured Networks
It is shown that for every fixed number of files, computing a latency-minimizing assignment is NP-hard via a reduction from the domatic number problem.
M. Pathegama, V. Cadambe
· 0 citations