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.
@article{arxiv.1710.11471,
title = {Distributed Server Allocation for Content Delivery Networks},
author = {Sarath Pattathil and Vivek S. Borkar and Gaurav S. Kasbekar},
journal= {arXiv preprint arXiv:1710.11471},
year = {2019}
}