Dynamic Performance Aware Reduce Task Scheduling in MapReduce on Virtualized Environment

Virtual Machine (VM) allocation for multiple tenants is an important and challenging problem to provide efficient infrastructure services in cloud data centers. Tenants run applications on their allocated VMs, and the network distance between a tenant's VMs may considerably impact the tenant's Quality of Service (QoS). In this study, we define and formulate the multi-tenant VM allocation problem in cloud data centers, considering the VM requirements of different tenants, and introducing the allocation goal of minimizing the sum of the VMs' network diameters of all tenants. Then, we propose a Layered Progressive resource allocation algorithm for multi-tenant cloud data centers based on the Multiple Knapsack Problem (LP-MKP). The LP-MKP algorithm uses a multi-stage layered progressive method for multi-tenant VM allocation and efficiently handles unprocessed tenants at each stage. This reduces resource fragmentation in cloud data centers, decreases the differences in the QoS among tenants, and improves tenants' overall QoS in cloud data centers. We perform experiments to evaluate the LP-MKP algorithm and demonstrate that it can provide significant gains over other allocation algorithms.

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.

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.

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.

Energy consumption is significant in cloud data centres even when some virtual machines (VMs) are idle. Taking into account both the energy efficiency and the response performance, we propose a VM allocation strategy with speed switch and VM consolidation in the cloud data centre. When the traffic is lighter, the processing speed of VMs in baseline module will be switched between a low speed and a high speed. When the traffic is much heavier, the VMs in reserved module will be consolidated with the VMs in baseline module, and operates at a high speed. We establish a two-dimensional Markov chain to mathematically estimate the energy-saving degree and the response performance. Numerical experiments with analysis and simulation show that our proposed VM allocation strategy can effectively reduce the energy consumption as well as guarantee the response performance.

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.

Live migration of virtual machine (VM) is a promising technology that helps physical machines (PMs) adapt to load changes and guarantees Quality of Service (QoS) in cloud data center. Many individual-based VM migration studies ignore the association between VMs, resulting in high communication cost. Some research on multiple VMs migration migrates the VM group as a whole, which is likely to result in ineffective migration and increase the network burden. In this paper, a VM migration algorithm based on group selection (VMMAGS) is proposed, which takes into account the migration cost, communication cost, and VM heat to optimize migration performance. The appropriate VM groups are selected as migration options, and the optimal migration scheme is obtained according to the integration cost of partitions of selected VM groups. Extensive experiments show that our algorithm can effectively reduce the migration cost and communication cost, improve the system reliability compared with other related algorithms.

Cloud computing models use virtual machine (VM) clusters for protecting resources from failure with backup capability. Cloud user tasks are scheduled by selecting suitable resources for executing the task in the VM cluster. Existing VM clustering processes suffer from issues like preconfiguration, downtime, complex backup process, and disaster management. VM infrastructure provides the high availability resources with dynamic and on-demand configuration. The proposed methodology supports VM clustering process to place and allocate VM based on the requesting task size with bandwidth level to enhance the efficiency and availability. The proposed clustering process is classified as preclustering and postclustering based on the migration. Task and bandwidth classification process classifies tasks with adequate bandwidth for execution in a VM cluster. The mapping of bandwidth to VM is done based on the availability of the VM in the cluster. The VM clustering process uses different performance parameters like lifetime of VM, utilization of VM, bucket size, and task execution time. The main objective of the proposed VM clustering is that it maps the task with suitable VM with bandwidth for achieving high availability and reliability. It reduces task execution and allocated time when compared to existing algorithms.

A virtual machine is a software replica of an underlying real machine. Multiple virtual machines can operate on the same host machine concurrently, without interfere each other. Such concept is becoming valuable in production computing systems, due to its benefits in terms of costs and portability. As they provide a strong isolation between the virtual environment and the underlying real system, virtual machines can also be used to improve the security of a computer system in face of attacks to its network services. This work presents a new approach to achieve this goal, by applying intrusion detection techniques to virtual machine based systems, thus keeping the intrusion detection system out of reach from intruders. The results obtained from a prototype implementation confirm the usefulness of this approach.

Nowadays, Cloud Service Providers (CSPs) provide flexible architectures and reliable internet accessories in cloud datacenters, where different types of applications are hosted. In order to achieve higher resource utilization and better quality of service, virtualization is widely used and implemented with virtual machines (VMs). However, most studies focus on VM management for utilization and energy, not yet considering the cost for emerging internet applications. Therefore, to further reduce network cost, we propose utilization-and-network-driven (UND) and only-network-driven (OND) strategies on top of the common minimal-migration (MM) based VM management as UND-MM and OND-MM. According to simulation results, both UND-MM and OND-MM strategies effectively reduce network cost by averagely 7% and 37%, respectively, of the original MM while retaining comparable resource utilization in CPU and memory for normally-loaded and overloaded datacenters. Moreover, the OND-MM, which is simpler, outperforms the UND-MM, and thus becomes more preferable for VM management in cloud datacenters.

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.

Security-aware dynamic VM consolidation

[Purpose] Server virtualization technology is the basic form for the cloud data center to serve customers. While the cloud data center reduces the SLA violations in the early stage, the increase in the utilization of resources such as virtual machine servers and network equipment and decrease in energy consumption have become an important issue for reduction of operating costs. Therefore, on the background of the cloud data center network based on SDN technology, this paper studies a cloud data center resource utilization and energy consumption optimization strategy through virtual machine migration and integration. [Method] The technology based on SDN is firstly introduced, the approximate optimal solution FFD algorithm for the multidimensional vector bin packing problem is then presented, the Partheno-Genetic Algorithm (PGA) is then recommended, finally a Hybrid Partheno genetic Algorithm (HPGA) based on the both is established and a mathematic model is created. [Results] By combining the advantages of FFD and PGA, this paper improves the utilization of the resources of the entire cloud data center, reduces energy consumption, and prevents the occurrence of computing “hot spots”. [Conclusion] Experiments in CloudSim prove the effectiveness of the algorithm. Compared with FFD and PGA algorithms, it is able to enhance the efficiency of the Data Center effectively, and obtain the optimal solution more quickly, thereby balancing the physical resources of the server.

Virtual machine (VM) consolidation is an effective way to improve resource utilization and reduce energy consumption in cloud data centers. Most existing studies have considered VM consolidation as a bin-packing problem, but the current schemes commonly ignore the long-term relationship between VMs and hosts. In addition, there is a lack of long-term consideration for resource optimization in the VM consolidation, which results in unnecessary VM migration and increased energy consumption. To address these limitations, a VM consolidation method based on multi-step prediction and affinity-aware technique for energy-efficient cloud data centers (MPaAFVMC) is proposed. The proposed method uses an improved linear regression prediction algorithm to predict the next-moment resource utilization of hosts and VMs, and obtains the stage demand of resources in the future period through multi-step prediction, which is realized by iterative prediction. Then, based on the multi-step prediction, an affinity model between the VM and host is designed using the first-order correlation coefficient and Euclidean distance. During the VM consolidation, the affinity value is used to select the migration VM and placement host. The proposed method is compared with the existing consolidation algorithms on the PlanetLab and Google cluster real workload data using the CloudSim simulation platform. Experimental results show that the proposed method can achieve significant improvement in reducing energy consumption, VM migration costs, and service level agreement (SLA) violations.

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.