Item request has been placed! ×
Item request cannot be made. ×
loading  Processing Request

Multi-Resource Allocation for Network Slicing under Service Level Agreements

Item request has been placed! ×
Item request cannot be made. ×
loading   Processing Request
  • Additional Information
    • Contributors:
      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; 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)
    • Publication Information:
      CCSD
      IEEE
    • Publication Date:
      2019
    • Collection:
      Université Paris-Dauphine: HAL
    • Subject Terms:
    • 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.
    • Accession Number:
      10.1109/NoF47743.2019.9014995
    • Online Access:
      https://hal.science/hal-02496683
      https://hal.science/hal-02496683v1/document
      https://hal.science/hal-02496683v1/file/1570587985.pdf
      https://doi.org/10.1109/NoF47743.2019.9014995
    • Rights:
      info:eu-repo/semantics/OpenAccess
    • Accession Number:
      edsbas.56B53C5F