Research Area: Cloud Computing
The adoption of cloud technologies is steadily increasing. In such systems, applications can benefit from nearly infinite virtual resources on a pay-per-use basis. However, being the cloud massively multi-tenant and characterized by highly variable workloads the development of more and more effective provisioning policies assumes paramount importance. Boosted by the success of the cloud, the application of Game Theory models and methodologies has also become popular, since they have been demonstrated to suit perfectly to cloud social, economic, and strategic structures. This paper aims to study, model and efficiently solve the cost minimization problem associated with the service provisioning of SaaS virtual machines in multiple IaaSs. We propose a game-theoretic approach for the runtime management of resources from multiple IaaS providers to be allocated to multiple competing SaaSs, along with a cost model including revenues and penalties for requests execution failures. A distributed algorithm for identifying Generalized Nash Equilibria has been developed and analysed in detail. The effectiveness of our approach has been assessed by performing a wide set of analyses under multiple workload conditions. Results show that our algorithm is scalable and provides significant cost savings with respect to alternative methods (80 percent on average). Furthermore, increasing the number of IaaS providers SaaSs can achieve 9-15 percent cost savings from the workload distribution on multiple IaaSs.
Keywords:
Author(s) Name: Danilo Ardagna; Michele Ciavotta; Mauro Passacantando
Journal name: IEEE Transactions on Services Computing
Conferrence name:
Publisher name: IEEE
DOI: 10.1109/TSC.2015.2477836
Volume Information: Volume: 10, Issue: 3, May-June 1 2017,Page(s): 381 - 395
