Distributed Server Allocation for Content Delivery Networks

10/28/2017

∙

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.

READ FULL TEXT

Distributed Server Allocation for Content Delivery Networks

Solving the non-preemptive two queue polling model with generally distributed service and switch-over durations and Poisson arrivals as a Semi-Markov Decision Process

Decentralized Task and Path Planning for Multi-Robot Systems

E-commerce warehousing: learning a storage policy

Optimal control policies for resource allocation in the Cloud: comparison between Markov decision process and heuristic approaches

Online Distributed Job Dispatching with Outdated and Partially-Observable Information

Bayes-Optimal Effort Allocation in Crowdsourcing: Bounds and Index Policies

Budget Allocation in Binary Opinion Dynamics

Distributed Server Allocation for Content Delivery Networks

Related Research

Solving the non-preemptive two queue polling model with generally distributed service and switch-over durations and Poisson arrivals as a Semi-Markov Decision Process

Decentralized Task and Path Planning for Multi-Robot Systems

E-commerce warehousing: learning a storage policy

Optimal control policies for resource allocation in the Cloud: comparison between Markov decision process and heuristic approaches

Online Distributed Job Dispatching with Outdated and Partially-Observable Information

Bayes-Optimal Effort Allocation in Crowdsourcing: Bounds and Index Policies

Budget Allocation in Binary Opinion Dynamics