Service Placement in Fog Computing Using Constraint Programming

Farah Ait Salaht 1 Frédéric Desprez 2 Adrien Lebre 3 Charles Prud'Homme 4 Mohamed Abderrahim 3, 4
1 AVALON - Algorithms and Software Architectures for Distributed and HPC Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
2 CORSE - Compiler Optimization and Run-time Systems
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
3 STACK - Software Stack for Massively Geo-Distributed Infrastructures
Inria Rennes – Bretagne Atlantique , LS2N - Laboratoire des Sciences du Numérique de Nantes
Abstract : This paper investigates whether the use of Constraint Programming (CP) could enable the development of a generic and easy-to-upgrade placement service for Fog Computing. Our contribution is a new formulation of the placement problem, an implementation of this model leveraging Choco-solver and an evaluation of its scalability in comparison to recent placement algorithms. To the best of our knowledge, our study is the first one to evaluate the relevance of CP approaches in comparison to heuristic ones in this context. CP interleaves inference and systematic exploration to search for solutions, letting users on what matters: the problem description. Thus, our service placement model not only can be easily enhanced (deployment constraints/objectives) but also shows a competitive tradeoff between resolution times and solutions quality.
Complete list of metadatas
Contributor : Farah Ait Salaht <>
Submitted on : Wednesday, April 24, 2019 - 2:02:18 PM
Last modification on : Friday, April 26, 2019 - 1:03:13 AM


Files produced by the author(s)


  • HAL Id : hal-02108806, version 1


Farah Ait Salaht, Frédéric Desprez, Adrien Lebre, Charles Prud'Homme, Mohamed Abderrahim. Service Placement in Fog Computing Using Constraint Programming. SCC 2019 - IEEE International Conference on Services Computing, Jul 2019, Milan, Italy. pp.1-9. ⟨hal-02108806⟩



Record views


Files downloads