Skip to Main content Skip to Navigation

On the mapping of distributed applications onto multiple Clouds

Abstract : The Cloud has become a very popular platform for deploying distributed applications. Today, virtually any credit card holder can have access to Cloud services. There are many different ways of offering Cloud services to customers. In this thesis we especially focus on theInfrastructure as a Service (IaaS), a model that, usually, proposes virtualized computing resources to costumers in the form of virtual machines (VMs). Thanks to its attractive pay-as-you-use cost model, it is easier for customers, specially small and medium companies, to outsource hosting infrastructures and benefit of savings related to upfront investments and maintenance costs. Also, customers can have access to features such as scalability, availability, and reliability, which previously were almost exclusive for large companies. To deploy a distributed application, a Cloud customer must first consider the mapping between her application (or its parts) to the target infrastructure. She needs to take into consideration cost, resource, and communication constraints to select the most suitable set of VMs, from private and public Cloud providers. However, defining a mapping manually may be a challenge in large-scale or time constrained scenarios since the number of possible configuration explodes. Furthermore, when automating this process, scalability issues must be taken into account given that this mapping problem is a generalization of the graph homomorphism problem, which is NP-complete.In this thesis we address the problem of calculating initial and reconfiguration placements for distributed applications over possibly multiple Clouds. Our objective is to minimize renting and migration costs while satisfying applications' resource and communication constraints. We concentrate on the mapping between applications and Cloud infrastructure. Using an incremental approach, we split the problem into three different parts and propose efficient heuristics that can compute good quality placements very quickly for small and large scenarios. These heuristics are based on graph partition and vector packing heuristics and have been extensively evaluated against state of the art approaches such as MIP solvers and meta-heuristics. We show through simulations that the proposed heuristics manage to compute solutions in a few seconds that would take many hours or days for other approaches to compute.
Complete list of metadatas

Cited literature [104 references]  Display  Hide  Download
Contributor : Abes Star :  Contact
Submitted on : Tuesday, February 13, 2018 - 4:06:06 PM
Last modification on : Monday, May 4, 2020 - 11:40:20 AM
Long-term archiving on: : Sunday, May 6, 2018 - 7:13:01 PM


Version validated by the jury (STAR)


  • HAL Id : tel-01708420, version 1


Pedro Paulo de Souza Bento da Silva. On the mapping of distributed applications onto multiple Clouds. Distributed, Parallel, and Cluster Computing [cs.DC]. Université de Lyon, 2017. English. ⟨NNT : 2017LYSEN089⟩. ⟨tel-01708420⟩



Record views


Files downloads