Show simple item record

dc.contributor.authorFossati, Francesca
dc.contributor.authorHoteit, Sahar
dc.contributor.authorMoretti, Stefano
dc.contributor.authorSecci, Stefano
dc.date.accessioned2019-04-18T10:29:04Z
dc.date.available2019-04-18T10:29:04Z
dc.date.issued2018
dc.identifier.issn1063-6692
dc.identifier.urihttps://basepub.dauphine.fr/handle/123456789/18691
dc.language.isoenen
dc.subjectResource allocation gamesen
dc.subjectfairnessen
dc.subject.ddc003en
dc.titleFair Resource Allocation in Systems With Complete Information Sharingen
dc.typeArticle accepté pour publication ou publié
dc.description.abstractenIn networking and computing, resource allocation is typically addressed using classical resource allocation protocols as the proportional rule, the max-min fair allocation, or solutions inspired by cooperative game theory. In this paper, we argue that, under awareness about the available resource and other users demands, a cooperative setting has to be considered in order to revisit and adapt the concept of fairness. Such a complete information sharing setting is expected to happen in 5G environments, where resource sharing among tenants (slices) need to be made acceptable by users and applications, which therefore need to be better informed about the system status via ad-hoc (northbound) interfaces than in legacy environments. We identify in the individual satisfaction rates the key aspect of the challenge of defining a new notion of fairness in systems with complete information sharing, consequently, a more appropriate resource allocation algorithm. We generalize the concept of user satisfaction considering the set of admissible solutions for bankruptcy games and we adapt to it the fairness indices. Accordingly, we propose a new allocation rule we call mood value: for each user, it equalizes our novel game-theoretic definition of user satisfaction with respect to a distribution of the resource. We test the mood value and a new fairness index through extensive simulations about the cellular frequency scheduling use-case, showing how they better support the fairness analysis. We complete the paper with further analysis on the behavior of the mood value in the presence of multiple competing providers and with cheating users.en
dc.relation.isversionofjnlnameIEEE/ACM Transactions on Networking
dc.relation.isversionofjnlvol26en
dc.relation.isversionofjnlissue6en
dc.relation.isversionofjnldate2018-12
dc.relation.isversionofjnlpages2801-2814en
dc.relation.isversionofjnlpublisherIEEE - Institute of Electrical and Electronics Engineersen
dc.subject.ddclabelRecherche opérationnelleen
dc.relation.forthcomingnonen
dc.relation.forthcomingprintnonen
dc.description.ssrncandidatenonen
dc.description.halcandidateouien
dc.description.readershiprechercheen
dc.description.audienceInternationalen
dc.relation.Isversionofjnlpeerreviewedouien
dc.relation.Isversionofjnlpeerreviewedouien
dc.date.updated2019-03-27T15:29:46Z
hal.person.labIds233
hal.person.labIds163556
hal.person.labIds989
hal.person.labIds16574
hal.identifierhal-02103386*


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record