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.
Ardagna, D., Ciavotta, M., Lancellotti, R., Guerriero, M. (2021). A Hierarchical Receding Horizon Algorithm for QoS-driven control of Multi-IaaS Applications. IEEE TRANSACTIONS ON CLOUD COMPUTING, 9(2 (April-June 1 2021)), 418-434 [10.1109/TCC.2018.2875443].
A Hierarchical Receding Horizon Algorithm for QoS-driven control of Multi-IaaS Applications
Ciavotta, M;
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.File | Dimensione | Formato | |
---|---|---|---|
tcc.pdf
accesso aperto
Tipologia di allegato:
Submitted Version (Pre-print)
Dimensione
2.34 MB
Formato
Adobe PDF
|
2.34 MB | Adobe PDF | Visualizza/Apri |
08489871.pdf
Solo gestori archivio
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Dimensione
2.38 MB
Formato
Adobe PDF
|
2.38 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.