Cloud computing is an emerging technology that allows to access computing resources on a pay-per-use basis. The main challenges in this area are the efficient performance management and the energy costs minimization. In this paper we model the service provisioning problem of Cloud Platform-as-a-Service systems as a Generalized Nash Equilibrium Problem and show that a potential function for the game exists. Moreover, we prove that the social optimum problem is convex and we derive some properties of social optima from the corresponding Karush-Kuhn-Tucker system. Next, we propose a distributed solution algorithm based on the best response dynamics and we prove its convergence to generalized Nash equilibria. Finally, we numerically evaluate equilibria in terms of their efficiency with respect to the social optimum of the Cloud by varying our algorithm initial solution. Numerical results show that our algorithm is scalable and very efficient and thus can be adopted for the run-time management of very large scale systems.
Anselmi, J., Ardagna, D., Passacantando, M. (2014). Generalized Nash Equilibria for SaaS/PaaS Clouds. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 236(1), 326-339 [10.1016/j.ejor.2013.12.007].
Generalized Nash Equilibria for SaaS/PaaS Clouds
Passacantando, M
2014
Abstract
Cloud computing is an emerging technology that allows to access computing resources on a pay-per-use basis. The main challenges in this area are the efficient performance management and the energy costs minimization. In this paper we model the service provisioning problem of Cloud Platform-as-a-Service systems as a Generalized Nash Equilibrium Problem and show that a potential function for the game exists. Moreover, we prove that the social optimum problem is convex and we derive some properties of social optima from the corresponding Karush-Kuhn-Tucker system. Next, we propose a distributed solution algorithm based on the best response dynamics and we prove its convergence to generalized Nash equilibria. Finally, we numerically evaluate equilibria in terms of their efficiency with respect to the social optimum of the Cloud by varying our algorithm initial solution. Numerical results show that our algorithm is scalable and very efficient and thus can be adopted for the run-time management of very large scale systems.File | Dimensione | Formato | |
---|---|---|---|
Anselmi-2014-Eur J Oper Res-AAM.pdf
accesso aperto
Descrizione: Research Article
Tipologia di allegato:
Author’s Accepted Manuscript, AAM (Post-print)
Dimensione
829.41 kB
Formato
Adobe PDF
|
829.41 kB | Adobe PDF | Visualizza/Apri |
Anselmi-2014-Eur J Oper Res-VoR.pdf
Solo gestori archivio
Descrizione: Research Article
Tipologia di allegato:
Publisher’s Version (Version of Record, VoR)
Dimensione
1.31 MB
Formato
Adobe PDF
|
1.31 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.