• français
    • English
  • English 
    • français
    • English
  • Login
JavaScript is disabled for your browser. Some features of this site may not work without it.
BIRD Home

Browse

This CollectionBy Issue DateAuthorsTitlesSubjectsJournals BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesSubjectsJournals

My Account

Login

Statistics

View Usage Statistics

Multi-Resource Allocation for Network Slicing under Service Level Agreements

Thumbnail
Date
2019
Link to item file
https://hal.archives-ouvertes.fr/hal-02496683
Dewey
Informatique générale
Sujet
scheduling algorithms; network slicing; service level agreements; physical network
DOI
http://dx.doi.org/10.1109/NoF47743.2019.9014995
Conference name
10th International Conference on the Network of the Future (NoF 2019)
Conference date
10-2019
Conference city
Rome
Conference country
Italy
Author
Cianfrani, Antonio; Riggio, Roberto; Steiner, Rebecca
Publisher
Institute of Electrical and Electronics Engineers
Pages number
146
ISBN
978-1-7281-4445-0
URI
https://basepub.dauphine.fr/handle/123456789/20858
Collections
  • LAMSADE : Publications
Metadata
Show full item record
Author
Fossati, Francesca
Moretti, Stefano
989 Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Secci, Stefano
Type
Communication / Conférence
Item number of pages
48-53
Abstract (EN)
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.

  • Accueil Bibliothèque
  • Site de l'Université Paris-Dauphine
  • Contact
SCD Paris Dauphine - Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16

 Content on this site is licensed under a Creative Commons 2.0 France (CC BY-NC-ND 2.0) license.