A Container-Based Technique to Improve Virtual Machine Migration in Cloud Computing

CBase: Fast Virtual Machine storage data migration with a new data center structure

Impact of Factors Affecting Pre-copy Virtual Machine Migration Technique for Cloud Computing

Virtualization techniques effectively handle the growing demand for computing, storage, and communication resources in large-scale Cloud Data Centers (CDC). It helps to achieve different resource management objectives like load balancing, online system maintenance, proactive fault tolerance, power management, and resource sharing through Virtual Machine (VM) migration. VM migration is a resource-intensive procedure as VM’s continuously demand appropriate CPU cycles, cache memory, memory capacity, and communication bandwidth. Therefore, this process degrades the performance of running applications and adversely affects efficiency of the data centers, particularly when Service Level Agreements (SLA) and critical business objectives are to be met. Live VM migration is frequently used because it allows the availability of application service, while migration is performed. In this paper, we make an exhaustive survey of the literature on live VM migration and analyze the various proposed mechanisms. We first classify the types of Live VM migration (single, multiple and hybrid). Next, we categorize VM migration techniques based on duplication mechanisms (replication, de-duplication, redundancy, and compression) and awareness of context (dependency, soft page, dirty page, and page fault) and evaluate the various Live VM migration techniques. We discuss various performance metrics like application service downtime, total migration time and amount of data transferred. CPU, memory and storage data is transferred during the process of VM migration and we identify the category of data that needs to be transferred in each case. We present a brief discussion on security threats in live VM migration and categories them in three different classes (control plane, data plane, and migration module). We also explain the security requirements and existing solutions to mitigate possible attacks. Specific gaps are identified and the research challenges in improving the performance of live VM migration are highlighted. The significance of this work is that it presents the background of live VM migration techniques and an in depth review which will be helpful for cloud professionals and researchers to further explore the challenges and provide optimal solutions.

Virtual machine (VM) management is one of the key problems in cloud data centers. Many efforts have been put on finding an (approximate) optimal placement of VMs at physical machines (PMs) to achieve high resource utility. In this paper, we consider to reduce the startup delay of VMs, which is a key issue for improving user experience and resource utility. The basic idea of our work is to cache VM images at PMs so as to reduce the time of VM image retrieval. By handling VM placement and image placement jointly and de-centrally, we design a joint placement algorithm and an associated layered transport VM selection algorithm, so as to start VMs quickly in the meanwhile save some calculation resources. The key point of our algorithms lies in how to accelerate the startup of VM with limited information in a distributed fat-tree network. The proposed algorithms are evaluated by extensive simulations using a distributed system simulator SimGrid. The results show that our algorithms just lost a little performance in most cases, compared with the centralized algorithm and a classical cache placement strategy.

Cloud computing is a new computation technology that provides services to consumers and businesses. The main idea of Cloud computing is to present software and hardware services through the Internet to the users and organizations at all levels. In Cloud computing, the users pay for the services, which means a usage-based payment system is used in this technology. Using virtualization technology in computation resources enables the appropriate utilization of resources in cloud computing. One of the most significant challenging issues in virtualization technology is the placement of optimal virtual machines on physical machines in cloud data centers. The placement of virtual machines comprises a process wherein virtual machines are mapped onto physical machines in cloud data centers. Optimal deployment leads to the reduction in power consumption, optimal use of resources, traffic reduction in data centers, costs reduction, and efficiency enhancement of the data center in the cloud. The present article proposed a new approach using a combination of the Sine–Cosine Algorithm and Salp Swarm Algorithm as discrete multi-objective and chaotic functions for optimal virtual machine placement. The first goal of the proposed algorithm was to reduce the power consumption in cloud data centers by condensing the number of active physical machines. The second goal was to reduce the waste of resources and manage it by optimally virtual machine placement on physical machines in cloud data centers. The third objective was to minimize and reduce Service Level Agreement among the active physical machines in cloud data centers. The proposed method prevent the increase in the migration of virtual machines onto physical machines. Ultimately, the results obtained from the proposed algorithm were compared with those of previous akin algorithms in the literature, including First Fit, Virtual Machine Placement Ant Colony System, and Modified Best Fit Decreasing. The proposed scheme is tested using Amazon EC2 Instances and the result indicated that the proposed algorithm performs better than the existing algorithms for various performance metrics.

Virtualisation is a major technology in cloud computing for optimising the cloud data centre's power usage. In the current scenario, most of the services are migrated to the cloud, putting more load on the cloud data centres. As a result, the data center's size expands resulting in increased energy usage. To address this problem, a resource allocation optimisation method that is both efficient and effective is necessary. The optimal utilisation of cloud infrastructure and optimisation algorithms plays a vital role. The cloud resources rely on the allocation policy of the virtual machine on cloud resources. A virtual machine placement technique, based on the Harris Hawk Optimisation (HHO) model for the cloud data centre is presented in this paper. The proposed HHO model aims to find the best place for virtual machines on suitable hosts with the least load and power consumption. PlanetLab's real-time workload traces are used for performance evaluation with existing PSO (Particle Swarm Optimisation) and PABFD (Best Fit Decreasing). The performance evaluation of the proposed method is done using power consumption, SLA, CPU utilisation, RAM utilisation, Execution time (ms) and the number of VM migrations. The performance evaluation is done using two simulation scenarios with scaling workload in scenario 1 and increasing resources for the virtual machine to study the performance in underloaded and overloaded conditions. Experimental results show that the proposed HHO algorithm improved execution time(ms) by 4%, had a 27% reduction in power consumption, a 16% reduction in SLA violation and an increase in resource utilisation by 17%. The HHO algorithm is also effective in handling dynamic and uncertain environments, making it suitable for real-world cloud infrastructures.

In modern data centres (DCs), energy consumption and resource management are challenging tasks. So in large virtualized DCs, performance of applications is highly dependent on energy-aware DC architecture and smooth network communication between virtual machines (VMs), while minimizing the communication burden to avoid congestion, latency etc. The communication cost of a network can be reduced by minimizing the VMs migration between physical machines (PMs). Therefore customer as well as service providers need cloud computing solutions that not only minimize operational costs, but also total network load. Minimizing the use of energy/network communication overhead with maximum resource utilization in large DCs is a challenging task as computing applications and data are growing so quickly for which increasing larger servers and disks are required to process them fast enough within the required time period. In order to minimize network load and maximize resource utilization in cloud DCs, we simulated our proposed network load-aware scheduling algorithm that ensures minimum VMs migration while delivering the negotiated Quality-of-Service (QoS). Our simulation also shows results with different bit rates.

The rapid growth in cloud computing encourages the cloud provider to create more reliable, scalable and efficient cloud environment. For providing such a scalable environment, cloud provider develops large-scale Cloud Data Centers (CDC). Such CDCs consume a large amount of electrical energy for operational purpose and cooling purpose to keep the machines operating at a right temperature, but it also emits a large amount of carbon-dioxide. Thus to decrease the energy consumption, Virtual Machines (VMs) are consolidated to fewer numbers of active servers through VM migration techniques, this leads to Service Level Agreement (SLA) violation and performance degradation. Therefore to retain the energy-performance tradeoff, we should perform an optimum number of VM migrations. There are two cases when the VM migration performed: First when a hot spot is found and Second when a cold spot is found. But in both the cases we do not directly migrate the VM instead first we check whether it is required to migrate the VM. After that, the algorithm finds an appropriate destination host on which the VM will be migrated. In this paper, we implement three approaches to select destination host: First-fit, Best-fit, and Worst-fit. Finally compare the result of a number of VM migration performed, energy consumption and SLA violations with existing one.

Virtual machine (VM) migration is a technique for transferring the execution state of a VM from one physical host to another. While VM migration is critical for load balancing, consolidation, and server maintenance in virtualized data centers, it can also increase security risks. During VM migration, an attacker with sufficient privileges can compromise a VM by modifying its memory contents during transit to subvert its applications or the guest operating system. One could maintain dedicated, and presumably more secure, control networks to carry the migration traffic, but at significant hardware and administrative complexity. Alternatively, one could encrypt the migration traffic, which eliminates the need for dedicated control networks, but might introduce performance overheads. To date, there has been no systematic study of how encryption affects VM migration, especially in high-bandwidth low-delay networks that are common within data centers. In this paper, we present a study of the impact of AES and 3DES encryption algorithms on two widely used live VM migration approaches -- pre-copy and post-copy. Our key findings are as follows. The encryption algorithm used can have a significant impact on the total migration time. The impact of encryption on downtime varies with the type of the migration technique. The overhead of encryption also depends upon the relative speeds of source and target machines. Finally, an application's performance within a VM during encrypted migration varies with the type of the application and the migration mechanism.

The article presents an efficient energy optimization framework based on dynamic resource scheduling for VM migration in cloud data centers. This increasing number of cloud data centers all over the world are consuming a vast amount of power and thus, exhaling a huge amount of CO2 that has a strong negative impact on the environment. Therefore, implementing Green cloud computing by efficient power reduction is a momentous research area. Live Virtual Machine (VM) migration, and server consolidation technology along with appropriate resource allocation of users' tasks, is particularly useful for reducing power consumption in cloud data centers. In this article, the authors propose algorithms which mainly consider live VM migration techniques for power reduction named “Power_reduction” and “VM_migration.” Moreover, the authors implement dynamic scheduling of servers based on sequential search, random search, and a maximum fairness search for convenient allocation and higher utilization of resources. The authors perform simulation work using CloudSim and the Cloudera simulator to evaluate the performance of the proposed algorithms. Results show that the proposed approaches achieve around 30% energy savings than the existing algorithms.

Live Virtual Machine (VM) migration has significantly improved the flexibility of modern Data Centers (DC). However, seamless live migration of a VM between geo-distributed DCs faces several challenges due to difficulties in preserving the network configuration after the migration paired with a large network convergence time. Although SDN-based approaches can speed up network convergence time, these techniques have two limitations. First, they typically react to the new topology by installing new flow rules once the migration is finished. Second, because the WAN is typically not under SDN control, they result in sub-optimal routing thus severely degrading the network performance once the VM is attached at the new location. In this paper, we identify networking challenges for VM migration across geo-distributed DCs. Based on those observations, we design a novel long-haul VM migration scheme that overcomes those limitations. First, instead of reactively restoring connectivity after the migration, our SDN-based approach proactively restores flows across the WAN towards the new location with the help of EVPN and VXLAN overlay technologies. Second, the SDN controller accelerates the network convergence by announcing the migration to other controllers using MP-BGP control plane messages. Finally, the SDN controller resolves the sub-optimal routing problem that arises as a result of migration implementing a distributed anycast gateway. We implement our approach as extensions to the OpenDaylight controller. Our evaluation shows that our approach outperforms existing approaches in reducing the downtime by 400 ms and increasing the application performance up to 12 times.

Recent developments in virtualization and communication technologies have transformed the way data centers are designed and operated by providing new tools for better sharing and control of data center resources. In particular, Virtual Machine (VM) migration is a powerful management technique that gives data center operators the ability to adapt the placement of VMs in order to better satisfy performance objectives, improve resource utilization and communication locality, mitigate performance hotspots, achieve fault tolerance, reduce energy consumption, and facilitate system maintenance activities. Despite these potential benefits, VM migration also poses new requirements on the design of the underlying communication infrastructure, such as addressing and bandwidth requirements to support VM mobility. Furthermore, devising efficient VM migration schemes is also a challenging problem, as it not only requires weighing the benefits of VM migration, but also considering migration costs, including communication cost, service disruption, and management overhead. This chapter provides an overview of VM migration benefits and techniques and discusses its related research challenges in data center environments. Specifically, the authors first provide an overview of VM migration technologies used in production environments as well as the necessary virtualization and communication technologies designed to support VM migration. Second, they describe usage scenarios of VM migration, highlighting its benefits as well as incurred costs. Next, the authors provide a literature survey of representative migration-based resource management schemes. Finally, they outline some of the key research directions pertaining to VM migration and draw conclusions.

The big data era is presenting unprecedented opportunities for generating new revenues in various sectors ranging from health care, economics, life science, to manufacturing. Datacenters (DCs) are widely deployed to provision various application services as well as to process big data. Since more and more servers are installed in DCs, the cost of electricity incurs a financial burden for the DC operators. Many DCs are equipped with renewable energy to reduce the electricity bill. However, the locations of the energy demands do not match the locations of the renewable energy generation. This mismatch may be addressed by virtual machine (VM) migration. The DCs, which lack renewable energy, can migrate their workloads to other DCs, which have abundant renewable energy. In addition, DC operators always want to maximize revenue and minimize operation cost. In this paper, the problem of maximizing revenue and minimizing operation cost of a green DC network enabled with and without VM migration is formulated by integer linear programming. Simulation results show that optimal results can be reached for small size problems. Two heuristic algorithms are proposed to efficiently solve large size problems. To our best knowledge, this is the first study of the revenue driven VM management problem in green DC networks towards big data with VM migration.

We propose two VM migration methods that improve the total sum of program correct by dynamically moving VMs to appropriate edge node. We assume a multi-hierarchy information processing system that the cloud data center and the edge node VM (Virtual Machine) perform processing at the same time, the data center completes all processing, and the VM has the required response time and returns a result that the processing has progressed (called accuracy). The first method is “VM sweeping method” that allocates more CPU time to VMs that perform high accuracy processing. The second methods is “VM sweeping method” that allocates more CPU time to VMs that perform high accuracy processing that improves per unit CPU time (AIR), and “VM number averaging method” that attempts to move VMs so that the assignment status of the CPU time in all edge nodes is equal. The accuracy improvement effect of the proposed VM migration method was evaluated by a simulator. Evaluations changed the AIR from the Early-blooming type where the accuracy greatly increases in the first half to the Late-blooming type where the accuracy greatly increases in the second half, and comparing it with the case where the VM is not moved. It was clarified that a big effect can be expected in the VM sweeping method, and the VM number averaging method in the Earlyblooming type program.

Cloud computing providers have to deal with the energy-performance trade-off: minimizing energy consumption, while meeting service level agreement (SLA) requirements. This paper proposes a new heuristic approach for the dynamic consolidation of virtual machines (VMs) in cloud data centers. The fast best-fit decreasing (FBFD) algorithm for intelligent VMs allocating into hosts and dynamic utilization rate (DUR) algorithm for utilization space and VM migration are successfully proposed. We performed simulations using PlanetLab and GWDG data center workloads to compare our approach against the existing models. It has been observed that the FBFD heuristic algorithm produces better results compared to modified BFD algorithm in terms of energy consumption and SLA violation. Additionally, the time complexity of FBFD algorithm is significantly improved from the order of O(\(m\,*\,n\)) to O(\(m\,*\,\log _2{n}\)). Furthermore, leaving some rates of capacity in the physical machines by the proposed DUR algorithm for VMs to be extended reduces the number of migrations which in turn improves the energy consumption and SLA violation. Our heuristic approach is evaluated using CloudSim and the results show that it performs better than the current state-of-the-art approaches.