Optimizing Cloud Resource Allocation; A Timeseries Forecasting Approach Using Cycleconsistent Adversarial Adaptation Network

ALVEC: Auto-scaling by Lotka Volterra elastic cloud: A QoS aware non linear dynamical allocation model

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.

Containerization does not only support fast development and deployment of web applications but also provides the potential to improve the energy efficiency in cloud data centers. In container-based clouds, containers are allocated to virtual machines (VMs) and VMs are allocated to physical machines (PMs). This new architecture requires consolidation algorithms to select heterogeneous VMs to host containers and consolidate VMs to PMs simultaneously. Existing server consolidation techniques in VM-based clouds can hardly be applied because of the two-level architecture of the container-based clouds. This paper proposes a novel genetic algorithm (GA) with dual chromosome representation to solve the problem. The experiments show that the proposed GA achieves significantly higher energy efficiency than the compared state-of-the-art algorithms on a wide range of test problems.

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.

[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.

With the increased penetration of cloud computing and virtualization, a plethora of internet of things devices have been deployed globally. As a result, computationally intensive tasks are transmitted from the edge towards the centralized cloud for processing that leads to increased energy utilization in the cloud data centers while at the same increasing significant latency for critical applications. Recent years have witnessed a paradigm shift from centralized cloud computing towards mobile edge computing (MEC), where computational tasks are offloaded at the edge servers near user equipment (UE). This paradigm leads to lowering the energy utilization in the cloud data centers, along with low latency for UE and efficient resource utilization at the edge. In this context, the scale and complexity of the MEC networks is drastically increasing and, consequently, finding effective energy-efficient solutions for computational task offloading and resource allocation in MEC networks has become an ambitious task. To address the aforementioned challenges, this work surveys the state of the art in different categorizations of algorithm-based computational task offloading and resource allocation strategies focusing on energy utilization. It also provides a detailed cross-comparison of existing strategies in terms of their implementation specifications. Additionally, this paper also highlights open challenges and potential future research directions to facilitate efficient task offloading and resource allocation at the edge with reduced energy consumption at the centralized data centers. Our work also paves the way for the deployment of critical applications at the edge that require low latency and high service quality guarantees.

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.

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.

Swarm learning anomaly detection framework for cloud data center using multi-channel BiWGAN-GTN and CEEMDAN

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.

Virtual Machine (VM) consolidation provides a promising approach to save energy and improve resource utilization in cloud data centers. However, aggressive consolidation of VMs may lead to performance degradation of data centers and even Service Level Agreement (SLA) violation. Therefore, it is very important to solve the tradeoff between reduction of SLA violation level and energy costs. In this paper, we propose a Host State 3-order Markov Chain prediction model for SLA-aware and energy efficient consolidation of VMs in cloud data centers. We propose two adaptive utilization thresholds based on a robust statistical method for host state estimate, and our model uses them to build a 3-order Markov Chain Transition Matrix manually for host state detection. We implement our algorithms on Cloudsim simulator for comparative study. The experimental results show that our model can significantly reduce SLA violation rates while keeping energy cost efficient, it can reduce the metric of SLA Violation by at most 98.69% and the metric of Energy by at most 21.88% for real world workload.

A metaheuristic method for joint task scheduling and virtual machine placement in cloud data centers

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.

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.