Distributed Server Allocation for Content Delivery Networks
arXiv:1710.114712 citationsh-index: 50
Originality Synthesis-oriented
AI Analysis
This work addresses the problem of efficient server allocation in content delivery networks, but the results are incremental as they rely on simulations without theoretical guarantees.
The paper proposes a dynamic formulation for file-sharing networks as a constrained Markov decision process and introduces an index policy based on a Whittle-like relaxation, showing through simulations that it outperforms other 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.