Distributed server allocation for content delivery networks
arXiv preprint arXiv:1710.11471, 2017•arxiv.org
We propose a dynamic formulation of file-sharing networks in terms of an average cost
Markov decision process with constraints. By analyzing a Whittle-like relaxation thereof, we
propose an index policy in the spirit of Whittle and compare it by simulations with other
natural heuristics.
Markov decision process with constraints. By analyzing a Whittle-like relaxation thereof, we
propose an index policy in the spirit of Whittle and compare it by simulations with other
natural heuristics.
We propose a dynamic formulation of file-sharing networks in terms of an average cost Markov decision process with constraints. By analyzing a Whittle-like relaxation thereof, we propose an index policy in the spirit of Whittle and compare it by simulations with other natural heuristics.
arxiv.org