CLOSE: A Costless Service Offloading Strategy for Distributed Edge Cloud

Abstract : New bandwidth-intensive and time-constrained services in 5G networks combined with network function virtual-ization is pushing network operators to deploy distributed cloud infrastructures at the edge of the network. Allocating resources in capacity-limited infrastructures raises new challenges, which have not really been so far considered in the cloud literature. In this context, we investigate placement and offloading strategies of constrained services. We set design principles of future distributed edge clouds in order to meet application requirements. We precisely introduce a costless distributed resource allocation algorithm, named CLOSE, which considers local information only. We compare via simulations the performance of CLOSE against those obtained by using mechanisms proposed in the literature, notably the Tricircle project within OpenStack. It turns out that the proposed distributed algorithm yields better performance while requiring less overhead.
Type de document :
Communication dans un congrès
GTCC 2017 - IEEE Workshop on Game Theory in Computer Communications, Jan 2017, Las Vegas, United States. pp.1-6
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01661624
Contributeur : Yassine Hadjadj Aoul <>
Soumis le : mardi 12 décembre 2017 - 08:59:09
Dernière modification le : mercredi 30 mai 2018 - 01:15:32

Fichier

close-costless-service.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01661624, version 1

Citation

Farah Slim, Fabrice Guillemin, Yassine Hadjadj-Aoul. CLOSE: A Costless Service Offloading Strategy for Distributed Edge Cloud. GTCC 2017 - IEEE Workshop on Game Theory in Computer Communications, Jan 2017, Las Vegas, United States. pp.1-6. 〈hal-01661624〉

Partager

Métriques

Consultations de la notice

475

Téléchargements de fichiers

83