Fair Resource Allocation with Varying Time Constraints

Abstract : —In this paper we discuss fair resource allocation among users with varying time constraints. Often, resource allocation problems study short-term (instantaneous) or long term (average) fairness where the resource allocation is over a given (same) period of time. What if we want to address fair sharing of resources when the users are interested in two different time periods? In this context, we study fair resource allocation among users with varying time constraints. We formulate this as a Markov Decision Process (MDP) for a two user case and provide a Dynamic Program (DP) solution. Simulation results in an LTE framework are provided to support the theoretical claims.
Document type :
Conference papers
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01702447
Contributor : Eitan Altman <>
Submitted on : Tuesday, February 6, 2018 - 6:03:28 PM
Last modification on : Tuesday, May 14, 2019 - 10:12:38 AM
Long-term archiving on : Saturday, May 5, 2018 - 11:18:31 AM

File

comsnets-sreenath.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01702447, version 1

Citation

Sreenath Ramanath, Eitan Altman. Fair Resource Allocation with Varying Time Constraints. COMSNETS 2018 - 10th International Conference on COMmunication Systems & NETwork, Jan 2018, Bangalore, India. pp.1-3. ⟨hal-01702447⟩

Share

Metrics

Record views

192

Files downloads

207