A Branch-and-Bound Algorithm for Autonomic Adaptation of Multi-Cloud Applications - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

A Branch-and-Bound Algorithm for Autonomic Adaptation of Multi-Cloud Applications

Résumé

Adaptation is an important concern in cloud-based applications composed of services provided by different cloud providers since cloud services can suffer from Quality of Services(QoS) fluctuations. Other conditions that can also trigger an adaptation process at runtime are the unavailability of services or the violation of user-defined policies. Moreover, the detection and reaction on such changes must be done in an autonomic way, without the need of user intervention. This paper presents a dynamic adaptation approach for multi-cloud applications supported by a Branch-and-Bound (B&B) algorithm in order to optimize the adaptation process itself when selecting the services to be deployed within the application. Computational experiments comparing the B&B algorithm with another algorithm that evaluates all possible configurations for adapting an application showed that the B&B algorithm is faster than the previous version. This new algorithm brings benefits to the scalability of the adaptation process, which can deal with large configurations of multi-cloud applications composed by a plethora of cloud services.
Fichier non déposé

Dates et versions

hal-01113090 , version 1 (04-02-2015)

Identifiants

Citer

André Almeida, Francisco Dantas, Everton Cavalcante, Thais Batista. A Branch-and-Bound Algorithm for Autonomic Adaptation of Multi-Cloud Applications. 14th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014), May 2014, Chicago, United States. pp.315-323, ⟨10.1109/CCGrid.2014.25⟩. ⟨hal-01113090⟩
168 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More