Back to Search Start Over

Multi-Resource Allocation for Network Slicing under Service Level Agreements

Authors :
Stefano Moretti
Francesca Fossati
Stefano Secci
CEDRIC. Réseaux et Objets Connectés (CEDRIC - ROC)
Centre d'études et de recherche en informatique et communications (CEDRIC)
Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)-Ecole Nationale Supérieure d'Informatique pour l'Industrie et l'Entreprise (ENSIIE)-Conservatoire National des Arts et Métiers [CNAM] (CNAM)
Phare
LIP6
Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)-Sorbonne Université (SU)-Centre National de la Recherche Scientifique (CNRS)
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE)
Université Paris Dauphine-PSL-Centre National de la Recherche Scientifique (CNRS)
Université Paris Dauphine-PSL
Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS)
ANR-18-CE25-0012,MAESTRO5G,Gestion de slices dans le réseau d'accès mobile de la 5G(2018)
Source :
2019 10th International Conference on Networks of the Future (NoF), 2019 10th International Conference on Networks of the Future (NoF), Oct 2019, Rome, Italy. pp.48-53, ⟨10.1109/NoF47743.2019.9014995⟩, NOF
Publication Year :
2019
Publisher :
HAL CCSD, 2019.

Abstract

International audience; Network slicing in 5G aims to provide an end-to-end partition of the physical network that is optimized for the service it has to supply. Each slice needs to fulfill a Service Level Agreement (SLA), that is a contract between the slice provider and the tenants on the quality of service and reliability, expressed for a diverse set of physical resources (spectrum, link capacity, computing power, etc). For the multi-resource allocation problem in network slicing, we provide two scheduling algorithms that take into account SLA requirements in terms of minimum and nominal resource quantity demands. We show that the algorithm that considers the availability rate of the service, in addition to providing the minimum capacity, has better performances in terms of time-fairness. For both scheduling algorithms we consider a user delaying policy able to take into account SLA priority and latency requirements.

Details

Language :
English
Database :
OpenAIRE
Journal :
2019 10th International Conference on Networks of the Future (NoF), 2019 10th International Conference on Networks of the Future (NoF), Oct 2019, Rome, Italy. pp.48-53, ⟨10.1109/NoF47743.2019.9014995⟩, NOF
Accession number :
edsair.doi.dedup.....b085f82a28c0edd0e7c051f28f75ef64
Full Text :
https://doi.org/10.1109/NoF47743.2019.9014995⟩