Published April 2023
| Version v1
Journal article
Locality-aware deployment of application microservices for multi-domain fog computing
Contributors
Others:
- École normale supérieure de Lyon (ENS de Lyon)
- Network Engineering and Operations (NEO ) ; Inria Sophia Antipolis - Méditerranée (CRISAM) ; Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)
- Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB)
- Laboratoire Informatique d'Avignon (LIA) ; Avignon Université (AU)-Centre d'Enseignement et de Recherche en Informatique - CERI
- Fondazione Bruno Kessler [Trento, Italy] (FBK)
- ANR-21-CE25-0013,PARFAIT,Planification et apprentissage pour AI-Edge Computing (PARFAIT)(2021)
- European Project: 815141,H2020-EU.2.1.1. - INDUSTRIAL LEADERSHIP - Leadership in enabling and industrial technologies - Information and Communication Technologies (ICT),EUK-01-2018 - Cloud, IoT and AI technologies ,DECENTER(2018)
- European Project: 101070473,HORIZON.2.4 - Digital, Industry and Space / HORIZON.2.4.7 - Advanced Computing and Big Data ,HORIZON-CL4-2021-DATA-01-05 - Future European platforms for the Edge: Meta Operating Systems (RIA) ,FLUIDOS(2022)
Description
In fog computing customers' microservices may demand access to connected objects, data sources and computing resources outside the domain of their fog provider In practice, the locality of connected objects renders mandatory a multi-domain approach in order to broaden the scope of resources available to a single-domain fog provider. We consider a scenario where assets from other domains can be leased across a federation of cloud-fog infrastructures. In this context, a fog provider aims to minimize the quantity of external resources to be rented to satisfy the applications' demands while meeting their requirements. We first introduce a general framework for the deployment of applications across multiple domains owned by multiple cloud-fog providers. Hence, the resource allocation problem is formulated in the form of an integer linear program. We provide a novel heuristic method that explores the resource assignment space in a breadth-first fashion to ensure that locality constraints are met. Extensive numerical results evaluate deployment costs and feasibility of the proposed solution demonstrating that it outperforms the standard approaches adopted in the literature.
Abstract
International audienceAdditional details
Identifiers
- URL
- https://inria.hal.science/hal-04367135
- URN
- urn:oai:HAL:hal-04367135v1
Origin repository
- Origin repository
- UNICA