Efficient and Optimal Service Component Distribution across Multiple Clouds

摘要

Cloud computing technology is one of the key considerations for business willing to access to different cloud services over the Internet and to benefit from the diversity of IaaS offers and pricing models. Although several solutions are available in the market, there are still some issues to solve. The main important aspect to address is the user’s request complexity, the vendor lock-in risk and the SLA fulfillment. In this paper, we propose a Multi-Cloud Broker called MCB that allows an efficient and optimal service component distribution among different clouds in flexible and dynamic infrastructure provisioning environment, in order to achieve better Quality of Service and cost efficiency. The request partitioning is the main step of our approach, this step is performed using Gomory-Hu tree based algorithm. Our simulation results show how our algorithm is better than existing partitioning algorithms in terms of running time.