Resource-sharing in a single server with time-varying capacity

Ayesta, Urtzi and Erausquin, Martin and Jacko, Peter (2011) Resource-sharing in a single server with time-varying capacity. In: Communication, Control, and Computing (Allerton), 2011 49th Annual Allerton Conference on :. IEEE, GBR, pp. 377-383. ISBN 9781457718175

[thumbnail of 2011_AyestaEtal_Ayestarule]
PDF (2011_AyestaEtal_Ayestarule)
2011_AyestaEtal_Ayestarule.pdf - Submitted Version

Download (162kB)


We investigate the problem of sharing the resources of a single server with time-varying capacity with the objective of minimizing the mean delay. We formulate the resource allocation problem as a Markov Decision Process. The problem is not solvable analytically in full generality, and we thus set out to obtain an approximate solution. In our main contribution, we extend the framework of multi-armed bandits to develop a heuristic solution of index type. At every given time, the heuristic assigns an index to every user that depends solely on its current state, and serves the user with highest current index value. We show that in the case of constant capacity, the heuristic policy is equivalent to the so-called Gittins index rule, which is known to be optimal under the assumption of constant capacity.

Item Type:
Contribution in Book/Report/Proceedings
Uncontrolled Keywords:
?? discipline-based research ??
ID Code:
Deposited By:
Deposited On:
21 Oct 2014 13:03
Last Modified:
18 Dec 2023 02:15