A new game theoretical resource allocation algorithm for cloud computing

  • Authors:
  • Fei Teng;Frédéric Magoulès

  • Affiliations:
  • Applied Mathematics and Systems Laboratory, Ecole Centrale Paris, Chatenay-Malabry Cedex, France;Applied Mathematics and Systems Laboratory, Ecole Centrale Paris, Chatenay-Malabry Cedex, France

  • Venue:
  • GPC'10 Proceedings of the 5th international conference on Advances in Grid and Pervasive Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cloud computing and other computing paradigms share the similar visions which aim to implement parallel computations on large distributed resources However, this cloud computing is more involved in purchasing and consuming manners between providers and users than others So how to allocate resources reasonably to cater requirements from both sides attracts wide attentions Based on game theory, we introduce a new Bayesian Nash Equilibrium Allocation algorithm to solve resource management problem in cloud computing This algorithm fully considers several criteria such as the heterogeneous distribution of resources, rational exchange behaviors of cloud users, incomplete common information and dynamic successive allocation Compared to former researches, experimental results presented in this paper show that even though rivals' information is uncertain, cloud users can receive Nash equilibrium allocation solutions by gambling stage by stage Furthermore, the resource price evaluated by the algorithm will converge to the optimal price at the end of the gambling sequence.