| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [9 references]
https://hal.inria.fr/hal-01702447
Contributor : Eitan Altman <>
Submitted on : Tuesday, February 6, 2018 - 6:03:28 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:03 PM
Document(s) archivé(s) le : Saturday, May 5, 2018 - 11:18:31 AM
Contributor : Eitan Altman <>
Submitted on : Tuesday, February 6, 2018 - 6:03:28 PM
Last modification on : Wednesday, June 24, 2020 - 4:19:03 PM
Document(s) archivé(s) le : Saturday, May 5, 2018 - 11:18:31 AM
File
comsnets-sreenath.pdf
Files produced by the author(s)