pith. sign in

arxiv: 1710.11471 · v4 · pith:BZ4JL5TLnew · submitted 2017-10-28 · 💻 cs.PF · cs.SY· eess.SY

Distributed Server Allocation for Content Delivery Networks

Sarath Pattathil , Vivek S. Borkar , Gaurav S. Kasbekar This is my paper
classification 💻 cs.PF cs.SYeess.SY
keywords networksproposeallocationanalyzingaveragecompareconstraintscontent
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. A unifying computations of Whittle's Index for Markovian bandits

    math.OC 2019-06 unverdicted novelty 8.0

    Derives a unifying closed-form expression for Whittle's index in Markovian bandits together with conditions for threshold optimality and indexability.