Non-Cooperative Gaming and Bidding Model Based Resource Allocation in Virtual Machine Environment

In this paper, we study resource allocation strategy about the virtualized servers. Based on a non-cooperative game theory, we employ 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 are well allocated to every virtual machine and the utilization of virtual resources is improved.