Distributed Server Allocation for Content Delivery Networks

Abstract

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.

22 pages, 10 figures

References in corpus (2)

• Balanced Fair Resource Sharing in Computer Clusters
• Admission and routing of soft real-time jobs to multiclusters: Design and comparison of index policies

Cited by in corpus (1)

• A unifying computations of Whittle's Index for Markovian bandits