Abstract: We studied resource allocation strategy about the virtualized servers. Based on a non-cooperative game theory, we employed bidding model to solve the resource allocation problem in virtualized servers with multiple instances competing for resources. The optimal response function of utility function which we introduced makes every player bidding prices reasonable. Although utility function is not well-defined at the point of zero,we show that the bidding game still has a unique equilibrium point. In our model,recourses arc well allocated to every virtual machine and arc improved the utilization of virtual resources.

Key words: Non-cooperative game, Nash equilibrium, Bidding model, Resource allocation, Virtual machine