Network slicing for guaranteed rate services: admission control and resource allocation games

e-Archivo Repository

Show simple item record Caballero, Pablo Banchs Roca, Albert De Veciana, Gustavo Costa-Pérez, Xavier Azcorra Saloña, Arturo 2019-03-26T14:59:43Z 2019-03-26T14:59:43Z 2018-10
dc.identifier.bibliographicCitation IEEE transactions on wireless communications, 17(10), pp. 6419-6432
dc.identifier.issn 1536-1276
dc.description.abstract Technologies that enable network slicing are expected to be a key component of next generation mobile networks. Their promise lies in enabling tenants (such as mobile operators and/or services) to reap the cost and performance benefits of sharing resources while retaining the ability to customize their own allocations. When employing dynamic sharing mechanisms, tenants may exhibit strategic behavior, optimizing their choices in response to those of other tenants. This paper analyzes dynamic sharing in network slicing when tenants support inelastic users with minimum rate requirements. We propose a NEtwork Slicing (NES) framework combining: 1) admission control; 2) resource allocation; and 3) user dropping. We model the network slicing system with admitted users as a NES game; this is a new class of game where the inelastic nature of the traffic may lead to dropping users whose requirements cannot be met. We show that, as long as admission control guarantees that slices can satisfy the rate requirements of all their users, this game possesses a Nash equilibrium. Admission control policies (a conservative and an aggressive one) are considered, along with a resource allocation scheme and a user dropping algorithm, geared at maintaining the system in Nash equilibria. We analyze our NES framework's performance in equilibrium, showing that it achieves the same or better utility than static resource partitioning, and bound the difference between NES and the socially optimal performance. Simulation results confirm the effectiveness of the proposed approach.
dc.description.sponsorship The work of University of Texas at Austin was supported in part by a gift from Cisco. The work of University Carlos III of Madrid was supported by the H2020 5G-MoNArch project (Grant Agreement No. 761445) and the 5GCity project of the Spanish Ministry of Economy and Competitiveness (TEC2016-76795-C6-3-R). The work of NEC Europe Ltd. was supported by the H2020 5G-Transformer project (Grant agreement no. 761536).
dc.format.extent 14
dc.format.mimetype application/pdf
dc.language.iso eng
dc.publisher IEEE
dc.rights © 2018 IEEE.
dc.subject.other Wireless networks
dc.subject.other Network slicing
dc.subject.other Multi-tenant networks
dc.subject.other Resource allocation
dc.subject.other Guaranteed rate service
dc.subject.other Inelastic traffic
dc.title Network slicing for guaranteed rate services: admission control and resource allocation games
dc.type article
dc.subject.eciencia Telecomunicaciones
dc.rights.accessRights openAccess
dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/761445/5G-MoNArch
dc.relation.projectID info:eu-repo/grantAgreement/EC/H2020/761536/5G Transformer
dc.relation.projectID Gobierno de España. TEC2016-76795-C6-3-R/5GCity
dc.type.version acceptedVersion
dc.identifier.publicationfirstpage 6419
dc.identifier.publicationissue 10
dc.identifier.publicationlastpage 6432
dc.identifier.publicationvolume 17
dc.identifier.uxxi AR/0000022207
dc.contributor.funder European Commission
dc.contributor.funder Ministerio de Economía y Competitividad (España)
 Find Full text

Files in this item

*Click on file's image for preview. (Embargoed files's preview is not supported)

This item appears in the following Collection(s)

Show simple item record