当前位置: X-MOL 学术Simul. Model. Pract. Theory › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimizing multi-VM migration by allocating transfer and compression rate using Geometric Programming
Simulation Modelling Practice and Theory ( IF 4.2 ) Pub Date : 2020-10-06 , DOI: 10.1016/j.simpat.2020.102201
Garima Singh , Anil Kumar Singh

Live VM migration has emerged as a core technology for resource management activities and objectives like fault tolerance, reduced energy consumption, load balancing, and system maintenance. Pre-copy migration strategy is frequently used by most of the existing hypervisors for live VM migration. However, it requires a considerable amount of data transfer. In the case of low network bandwidth availability, the migration process gets adversely affected. Thereby degrading the performance of applications running on migrated VMs. Migrating multiple VMs even requires more data to be transferred, which further faces the challenge of sharing the available network bandwidth. This motivates for designing a better strategy for the live migration of multiple VMs. Moreover, to reduce the amount of data that needs to be transferred, memory compression techniques can be utilized efficiently by providing fast and stable VM memory migration without sacrificing any service quality. This paper presents a new model using Geometric Programming that allocates transfer and compression rates to each VM to minimize the total migration time. We have found that: (a). Memory compression, along with pre-copy migration, improves the performance of the live migration of multiple virtual machines by reducing the total migration time and downtime. (b). The compression rate is dynamically allocated according to the available network bandwidth. So, in an adverse environment, when available bandwidth is less, the memory is compressed using slow compression algorithms to optimize the total migration time. In contrast, when more bandwidth is available, it uses a fast compression algorithm to transfer the data quickly. (c). With the proposed approach, more number of VMs can be migrated in parallel with considerably reduced migration time and downtime when compared with existing strategies.



中文翻译:

通过使用几何编程分配传输和压缩率来优化多VM迁移

实时VM迁移已成为资源管理活动和目标(如容错,减少能耗,负载平衡和系统维护)的核心技术。大多数现有虚拟机管理程序经常使用复制前迁移策略进行实时VM迁移。但是,这需要大量的数据传输。在网络带宽可用性低的情况下,迁移过程会受到不利影响。从而降低了在迁移的VM上运行的应用程序的性能。迁移多个VM甚至需要传输更多数据,这进一步面临共享可用网络带宽的挑战。这激发了为多个VM实时迁移设计更好的策略的动机。此外,为了减少需要传输的数据量,通过提供快速且稳定的VM内存迁移,可以在不牺牲任何服务质量的情况下有效地利用内存压缩技术。本文介绍了一种使用几何编程的新模型,该模型为每个VM分配了传输和压缩率,以最大程度地减少总迁移时间。我们发现:(a)。内存压缩以及预复制迁移可通过减少总迁移时间和停机时间来提高多个虚拟机的实时迁移性能。(b)。压缩率是根据可用的网络带宽动态分配的。因此,在不利的环境中,当可用带宽较小时,将使用慢速压缩算法压缩内存以优化总迁移时间。相反,当有更多带宽可用时,它使用快速压缩算法来快速传输数据。(C)。与现有策略相比,通过提出的方法,可以并行迁移更多数量的VM,同时大大减少了迁移时间和停机时间。

更新日期:2020-10-06
down
wechat
bug