Multiscale Fairness and Its Application to Resource Allocation in Wireless Networks

Abstract : Fair resource allocation is usually studied in a static context, in which a fixed amount of resources is to be shared. In dynamic resource allocation one usually tries to assign resources instantaneously so that the average share of each user is split fairly. The exact definition of the average share may depend on the application, as different applications may require averaging over different time periods or time scales. Our main contribution is to introduce new refined definitions of fairness that take into account the time over which one averages the performance measures. We examine how the constraints on the averaging durations impact the amount of resources that each user gets.
Liste complète des métadonnées

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01597970
Contributor : Hal Ifip <>
Submitted on : Friday, September 29, 2017 - 9:46:21 AM
Last modification on : Saturday, January 27, 2018 - 1:31:41 AM
Document(s) archivé(s) le : Saturday, December 30, 2017 - 1:05:13 PM

File

978-3-642-20798-3_17_Chapter.p...
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Eitan Altman, Konstantin Avrachenkov, Sreenath Ramanath. Multiscale Fairness and Its Application to Resource Allocation in Wireless Networks. Jordi Domingo-Pascual; Pietro Manzoni; Sergio Palazzo; Ana Pont; Caterina Scoglio. 10th IFIP Networking Conference (NETWORKING), May 2011, Valencia, Spain. Springer, Lecture Notes in Computer Science, LNCS-6641 (Part II), pp.225-237, 2011, NETWORKING 2011. 〈10.1007/978-3-642-20798-3_17〉. 〈hal-01597970〉

Share

Metrics

Record views

145

Files downloads

19