Cloud Computing is emerging as a major trend in ICT industry. As with any new technology, new major challenges lie ahead, one of them concerning the resource provisioning. Modern Cloud applications deal with a dynamic context that requires a continuous adaptation process to meet satisfactory QoS. Unfortunately, current Cloud platforms provide just simple rule-based tools that can be unsuitable in many situations as they do not prevent SLA violations, but only react to them. This situation calls for advanced solutions designed to provide Cloud resources in a predictive and dynamic way. This work presents capacity allocation algorithms whose goal is to minimize the total execution cost while satisfying some constraints on the average response time of Cloud based applications. An extensive evaluation of our solution against an Oracle with perfect knowledge of the future and well-known heuristics presented in the literature is provided. The analysis shows that our solution outperforms the heuristics producing results very close to the optimal ones and reducing the number of QoS violations. Analytical results are validated also through simulation, which analyses the impact of Cloud environment random perturbations. Finally, experiments on a prototype environment demonstrate the effectiveness of our approach under real workloads.

A Hierarchical Receding Horizon Algorithm for QoS-driven control of Multi-IaaS Applications / Ardagna, Danilo; Ciavotta, Michele; Lancellotti, Riccardo; Guerriero, Michele. - In: IEEE TRANSACTIONS ON CLOUD COMPUTING. - ISSN 2168-7161. - 9:2(2021), pp. 418-434. [10.1109/TCC.2018.2875443]

A Hierarchical Receding Horizon Algorithm for QoS-driven control of Multi-IaaS Applications

Riccardo Lancellotti;
2021

Abstract

Cloud Computing is emerging as a major trend in ICT industry. As with any new technology, new major challenges lie ahead, one of them concerning the resource provisioning. Modern Cloud applications deal with a dynamic context that requires a continuous adaptation process to meet satisfactory QoS. Unfortunately, current Cloud platforms provide just simple rule-based tools that can be unsuitable in many situations as they do not prevent SLA violations, but only react to them. This situation calls for advanced solutions designed to provide Cloud resources in a predictive and dynamic way. This work presents capacity allocation algorithms whose goal is to minimize the total execution cost while satisfying some constraints on the average response time of Cloud based applications. An extensive evaluation of our solution against an Oracle with perfect knowledge of the future and well-known heuristics presented in the literature is provided. The analysis shows that our solution outperforms the heuristics producing results very close to the optimal ones and reducing the number of QoS violations. Analytical results are validated also through simulation, which analyses the impact of Cloud environment random perturbations. Finally, experiments on a prototype environment demonstrate the effectiveness of our approach under real workloads.
2021
9
2
418
434
A Hierarchical Receding Horizon Algorithm for QoS-driven control of Multi-IaaS Applications / Ardagna, Danilo; Ciavotta, Michele; Lancellotti, Riccardo; Guerriero, Michele. - In: IEEE TRANSACTIONS ON CLOUD COMPUTING. - ISSN 2168-7161. - 9:2(2021), pp. 418-434. [10.1109/TCC.2018.2875443]
Ardagna, Danilo; Ciavotta, Michele; Lancellotti, Riccardo; Guerriero, Michele
File in questo prodotto:
File Dimensione Formato  
tcc.pdf

Accesso riservato

Tipologia: Versione dell'autore revisionata e accettata per la pubblicazione
Dimensione 2.34 MB
Formato Adobe PDF
2.34 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/1167033
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 15
  • ???jsp.display-item.citation.isi??? 5
social impact