摘要
Iaa S云计算平台采用虚拟机实时迁移技术进行资源动态调度和管理。在实际应用场景下,需要并行实时迁移多个虚拟机。由于实时迁移算法本身以最大利用带宽的方式进行数据传输,存在着迁移进程间竞争带宽的问题,无法保证带宽全局最优分配,影响整体迁移的性能。提出一种基于合作博弈的多虚拟机实时迁移带宽分配机制,将带宽分配问题建模为一个纳什议价,通过求解纳什议价解得到帕累托最优的带宽分配方案,并在实际的虚拟化平台上进行了实现。实验结果表明,相比标准的并行实时迁移,所提出的带宽分配机制能够公平有效地分配带宽,提高了并行实时迁移的性能。
In Iaa S cloud computing platform, live migration of virtual machines plays a significant role in resource dynamic 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 bandwidth allocation mechanism in live migration of multiple 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 improve the performance of the parallel live migration.
出处
《通信学报》
EI
CSCD
北大核心
2016年第4期149-158,共10页
Journal on Communications
基金
教育部博士点专项科研基金资助项目(No.20114101110007)
河南省科研重点基金资助项目(No.13A520562)
河南省创新人才基金资助项目(No.2011HASTIT003)~~
关键词
实时迁移
虚拟机
带宽分配
纳什议价
合作博弈
live migration
virtual machine
bandwidth allocation
Nash bargaining
cooperative game
