In EDS ansehen

GIRAFF: Reverse Auction-based Placement for Fog Functions ; GIRAFF: Enchères Inversées pour le Placement de Fonctions dans le Fog ; GIRAFF

Gespeichert in:
Bibliographische Detailangaben
Titel: GIRAFF: Reverse Auction-based Placement for Fog Functions ; GIRAFF: Enchères Inversées pour le Placement de Fonctions dans le Fog ; GIRAFF
Autoren: Parol-Guarino, Volodia, Parlavantzas, Nikos
Weitere Verfasser: Design and Implementation of Autonomous Distributed Systems (MYRIADS), Centre Inria de l'Université de Rennes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-SYSTÈMES LARGE ÉCHELLE (IRISA-D1), Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-Institut National de Recherche en Informatique et en Automatique (Inria)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Université de Rennes (UR)-Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT)-Institut de Recherche en Informatique et Systèmes Aléatoires (IRISA), Institut National des Sciences Appliquées (INSA)-Institut National des Sciences Appliquées (INSA)-Université de Bretagne Sud (UBS)-École normale supérieure - Rennes (ENS Rennes)-CentraleSupélec-Centre National de la Recherche Scientifique (CNRS)-IMT Atlantique (IMT Atlantique), Institut Mines-Télécom Paris (IMT)-Institut Mines-Télécom Paris (IMT), Institut National des Sciences Appliquées - Rennes (INSA Rennes), Institut National des Sciences Appliquées (INSA)
Quelle: WoSC 2023 - 9th International Workshop on Serverless Computing ; https://inria.hal.science/hal-04384516 ; WoSC 2023 - 9th International Workshop on Serverless Computing, Dec 2023, Bologna, Italy. pp.53-58, ⟨10.1145/3631295.3631402⟩
Verlagsinformationen: CCSD
ACM
Publikationsjahr: 2023
Schlagwörter: fog, FaaS, function-as-a-service, serverless, auction, SLA, servicelevel agreement, QoS, quality of service, testbed, Grid'5000, [INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
Geographisches Schlagwort: Bologna, Italy
Beschreibung: International audience ; Function-as-a-Service (FaaS) is a compelling new programming model for developing applications running on fog infrastructures. FaaS applications are composed of short-lived, event-triggered units, called functions. Functions can be flexibly deployed on demand along the cloud-to-thing continuum. However, deciding how to place those functions in the fog presents multiple challenges. The fog contains diverse, geo-distributed, and potentially resource-constrained nodes that should be efficiently shared between applications with latency requirements. Importantly, fog nodes are owned by different entities that should be incentivized to share their resources. Most function placement approaches ignore latency requirements or the presence of multiple owners in fog infrastructures. To address these challenges, this article proposes a marketbased approach to place FaaS applications in the fog. Clients submit function placement requests associated with SLAs that specify expected guarantees over network latency and allocated resources. The approach then organizes an auction among fog node providers to determine the nodes that host each function and the revenue of the provider. The article presents an open-source implementation of the approach evaluated on the Grid'5000 testbed. Experiments demonstrate that our approach can reduce client spending by up to three times while delivering service quality that matches or exceeds that of baseline methods. CCS CONCEPTS • Computer systems organization → Distributed architectures.
Publikationsart: conference object
Sprache: English
DOI: 10.1145/3631295.3631402
Verfügbarkeit: https://inria.hal.science/hal-04384516
https://inria.hal.science/hal-04384516v1/document
https://inria.hal.science/hal-04384516v1/file/GIR.pdf
https://doi.org/10.1145/3631295.3631402
Rights: http://hal.archives-ouvertes.fr/licences/copyright/ ; info:eu-repo/semantics/OpenAccess
Dokumentencode: edsbas.3FC9402E
Datenbank: BASE
Beschreibung
Abstract:International audience ; Function-as-a-Service (FaaS) is a compelling new programming model for developing applications running on fog infrastructures. FaaS applications are composed of short-lived, event-triggered units, called functions. Functions can be flexibly deployed on demand along the cloud-to-thing continuum. However, deciding how to place those functions in the fog presents multiple challenges. The fog contains diverse, geo-distributed, and potentially resource-constrained nodes that should be efficiently shared between applications with latency requirements. Importantly, fog nodes are owned by different entities that should be incentivized to share their resources. Most function placement approaches ignore latency requirements or the presence of multiple owners in fog infrastructures. To address these challenges, this article proposes a marketbased approach to place FaaS applications in the fog. Clients submit function placement requests associated with SLAs that specify expected guarantees over network latency and allocated resources. The approach then organizes an auction among fog node providers to determine the nodes that host each function and the revenue of the provider. The article presents an open-source implementation of the approach evaluated on the Grid'5000 testbed. Experiments demonstrate that our approach can reduce client spending by up to three times while delivering service quality that matches or exceeds that of baseline methods. CCS CONCEPTS • Computer systems organization → Distributed architectures.
DOI:10.1145/3631295.3631402