Journal on Communications ›› 2016, Vol. 37 ›› Issue (4): 149-158.doi: 10.11959/j.issn.1000-436x.2016082

• academic paper • Previous Articles     Next Articles

Cooperative game based bandwidth allocation mechanism live migration of multiple virtual machines

Yong CUI1,2,Yu-song LIN2,Run-zhi LI2,Zong-min WANG2   

  1. 1 Institute of Information Engineering, Zhengzhou University, Zhengzhou 450001, China
    2 Key Lab on Information Networking, Zhengzhou University, Zhengzhou 450052, China
  • Online:2016-04-25 Published:2016-04-26
  • Supported by:
    The Specialized Research Fund for the Doctoral Program for Higher Education;The Key Research Project of Henan Province Department of Education;The Innovative Talent Project of Henan Province Department of Education

Abstract:

In IaaS cloud computing platform, live migration of virtual machines plays a significant role in resource dy-namic dispatching and management. Under many scenarios, multiple virtual machines in the same server need to be moved online concurrently.Since live migration algorithm utilizes bandwidth as more as possible to send data, there is a bandwidth competition among the concurrent migration processes, which cannot guarantee the optimal allocation for the bandwidth and finally degrades the overall performance of the parallel live migration. A cooperative game based band-width allocation mechanism in live migration of multip virtual machines was proposed, which models the bandwidth allocation problem as a Nash bargaining game and attains a desirable bandwidth sharing scheme that guarantees Pareto optimality. Experiment results show that the proposed method can assign the bandwidth fairly and efficiently and im-prove the performance of the parallel live migration.

Key words: live migration, virtual machine, bandwidth allocation, Nash bargaining, cooperative game

No Suggested Reading articles found!