This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalized Nash Equilibria for the Service Provisioning Problem in Cloud Systems
Oct.-Dec. 2013 (vol. 6 no. 4)
pp. 429-442
Danilo Ardagna, Politecnico di Milano, Milan
Barbara Panicucci, Universita di Modena e Reggio Emilia, Reggio Emilia
Mauro Passacantando, Universita di Pisa, Pisa
Web Extras: View Supplemental Material (PDF)
In recent years, the evolution and the widespread adoption of virtualization, service-oriented architectures, autonomic, and utility computing have converged letting a new paradigm to emerge: cloud computing. Clouds allow the on-demand delivering of software, hardware, and data as services. Currently, the cloud offer is becoming wider day by day because all the major IT companies and service providers, like Microsoft, Google, Amazon, HP, IBM, and VMWare, have started providing solutions involving this new technological paradigm. As cloud-based services are more numerous and dynamic, the development of efficient service provisioning policies becomes increasingly challenging. In this paper, we take the perspective of Software as a Service (SaaS) providers that host their applications at an Infrastructure as a Service (IaaS) provider. Each SaaS needs to comply with quality-of-service requirements, specified in service-level agreement (SLA) contracts with the end users, which determine the revenues and penalties on the basis of the achieved performance level. SaaS providers want to maximize their revenues from SLAs, while minimizing the cost of use of resources supplied by the IaaS provider. Moreover, SaaS providers compete and bid for the use of infrastructural resources. On the other hand, the IaaS wants to maximize the revenues obtained providing virtualized resources. In this paper, we model the service provisioning problem as a generalized Nash game and we show the existence of equilibria for such game. Moreover, we propose two solution methods based on the best-reply dynamics, and we prove their convergence in a finite number of iterations to a generalized Nash equilibrium. In particular, we develop an efficient distributed algorithm for the runtime allocation of IaaS resources among competing SaaS providers. We demonstrate the effectiveness of our approach by simulation and performing tests on a real prototype environment deployed on Amazon EC2. Results show that, compared to other state-of-the-art solutions, our model can improve the efficiency of the cloud system evaluated in terms of Price of Anarchy by 50-70 percent.
Index Terms:
Cloud computing,Computational modeling,Game theory,Quality of service,Contracts,Resource management,quality concepts,Cloud computing,Game Theory,resource allocation,performance attributes,client/server,distributed applications
Citation:
Danilo Ardagna, Barbara Panicucci, Mauro Passacantando, "Generalized Nash Equilibria for the Service Provisioning Problem in Cloud Systems," IEEE Transactions on Services Computing, vol. 6, no. 4, pp. 429-442, Oct.-Dec. 2013, doi:10.1109/TSC.2012.14
Usage of this product signifies your acceptance of the Terms of Use.