Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/hal-01661624
Contributor : Yassine Hadjadj Aoul <>
Submitted on : Tuesday, December 12, 2017 - 8:59:09 AM
Last modification on : Thursday, February 25, 2021 - 5:30:02 PM

File

close-costless-service.pdf
Files produced by the author(s)

Identifiers

  • 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 2018 - IEEE Workshop on Game Theory in Computer Communications, Jan 2018, Las Vegas, United States. pp.1-6. ⟨hal-01661624⟩

Share

Metrics

Record views

788

Files downloads

294