By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jian Wan ; Grid & Services Comput. Lab., Hangzhou Dianzi Univ., Hangzhou, China ; Dechuan Deng ; Congfeng Jiang

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.

Published in:

Parallel and Distributed Processing Symposium Workshops & PhD Forum (IPDPSW), 2012 IEEE 26th International

Date of Conference:

21-25 May 2012