Search results

Virtual machines (VMs) are suggested by the providers of cloud services as the services for the users over the internet. The consolidation of VM is the tactic of the competent and smart utilization of resources from cloud data centers. Placement of a VM is one of the significant issues in cloud computing (CC). Physical machines in a cloud environment are aware of the way of the VM placement (VMP) as the mapping VMs. The basic target of placement of VM issue is to reduce the physical machines' items that are running or the hosts in cloud data centers. The VMP methods have an important role in the CC. However, there is no systematic and complete way to discuss and analyze the algorithms. The purpose of this paper is to present a systematic survey of VMP techniques. Also, the benefits and weaknesses connected with selected VMP techniques have been debated, and the significant issues of these techniques are addressed to develop the more efficient VMP technique for the future.

Because of the importance of VMP in the cloud environments, in this paper, the articles and important mechanisms in this domain have been investigated systematically. The VMP mechanisms have been categorized into two major groups, including static and dynamic mechanisms.

The results have indicated that an appropriate VMP has the capacity to decrease the resource consumption rate, energy consumption and carbon emission rate. VMP approaches in computing environment still need improvements in terms of reducing related overhead, consolidation of the cloud environment to become an extremely on-demand mechanism, balancing the load between physical machines, power consumption and refining performance.

This study aimed to be comprehensive, but there were some limitations. Some perfect work may be eliminated because of applying some filters to choose the original articles. Surveying all the papers on the topic of VMP is impossible, too. Nevertheless, the authors are trying to present a complete survey over the VMP.

The consequences of this research will be valuable for academicians, and it can provide good ideas for future research in this domain. By providing comparative information and analyzing the contemporary developments in this area, this research will directly support academics and working professionals for better knowing the growth in the VMP area.

The gathered information in this paper helps to inform the researchers with the state of the art in the VMP area. Totally, the VMP's principal intention, current challenges, open issues, strategies and mechanisms in cloud systems are summarized by explaining the answers.

This purpose of this paper is to propose a novel hybrid genetic algorithm based on a virtual machine (VM) placement method to improve energy efficiency in cloud data centers. How to place VMs on physical machines (PMs) to improve resource utilization and reduce energy consumption is one of the major concerns for cloud providers. Over the past few years, many approaches for VM placement (VMP) have been proposed; however, existing VM placement approaches only consider energy consumption by PMs, and do not consider the energy consumption of the communication network of a data center.

This paper attempts to solve the energy consumption problem using a VM placement method in cloud data centers. Our approach uses a repairing procedure based on a best-fit decreasing heuristic to resolve violations caused by infeasible solutions that exceed the capacity of the resources during the evolution process.

In addition, by reducing the energy consumption time with the proposed technique, the number of VM migrations was reduced compared with existing techniques. Moreover, the communication network caused less service level agreement violations (SLAV).

The proposed algorithm aims to minimize energy consumption in both PMs and communication networks of data centers. Our hybrid genetic algorithm is scalable because the computation time increases nearly linearly when the number of VMs increases.

Cloud computing services gained huge attention in recent years and many organizations started moving their business data traditional server to the cloud storage providers. However, increased data storage introduces challenges like inefficient usage of resources in the cloud storage, in order to meet the demands of users and maintain the service level agreement with the clients, the cloud server has to allocate the physical machine to the virtual machines as requested, but the random resource allocations procedures lead to inefficient utilization of resources.

This thesis focuses on resource allocation for reasonable utilization of resources. The overall framework comprises of cloudlets, broker, cloud information system, virtual machines, virtual machine manager, and data center. Existing first fit and best fit algorithms consider the minimization of the number of bins but do not consider leftover bins.

The proposed algorithm effectively utilizes the resources compared to first, best and worst fit algorithms. The effect of this utilization efficiency can be seen in metrics where central processing unit (CPU), bandwidth (BW), random access memory (RAM) and power consumption outperformed very well than other algorithms by saving 15 kHz of CPU, 92.6kbps of BW, 6GB of RAM and saved 3kW of power compared to first and best fit algorithms.

The proposed multi-objective bin packing algorithm is better for packing VMs on physical servers in order to better utilize different parameters such as memory availability, CPU speed, power and bandwidth availability in the physical machine.

Current industrial scenario is largely dependent on cloud computing paradigms. On-demand services provided by cloud data centre are paid as per use. Hence, it is very important to make use of the allocated resources to the maximum. The resource utilization is highly dependent on the allocation of resources to the incoming request. The allocation of requests is done with respect to the physical machines present in the datacenter. While allocating the tasks to these physical machines, it needs to be allocated in such a way that no physical machine is underutilized or over loaded. To make sure of this, optimal load balancing is very important.

The paper proposes an algorithm which makes use of the fitness functions and duopoly game theory to allocate the tasks to the physical machines which can handle the resource requirement of the incoming tasks. The major focus of the proposed work is to optimize the load balancing in a datacenter. When optimization happens, none of the physical machine is neither overloaded nor under-utilized, hence resulting in efficient utilization of the resources.

The performance of the proposed algorithm is compared with different existing load balancing algorithms such as round-robin load (RR) ant colony optimization (ACO), artificial bee colony (ABC) with respect to the selected parameters response time, virtual machine migrations, host shut down and energy consumption. All the four parameters gave a positive result when the algorithm is simulated.

The contribution of this paper is towards the domain of cloud load balancing. The paper is proposing a novel approach to optimize the cloud load balancing process. The results obtained show that response time, virtual machine migrations, host shut down and energy consumption are reduced in comparison to few of the existing algorithms selected for the study. The proposed algorithm based on the duopoly function and fitness function brings in an optimized performance compared to the four algorithms analysed.

The containerization application is one among the technologies that enable microservices architectures, which is observed to be the model for operating system (OS) virtualization. Containers are the virtual instances of the OS that are structured as the isolation for the OS atmosphere and its file system, which are executed on the single kernel and a single host. Hence, every microservice application is evolved in a container without launching the total virtual machine. The system overhead is minimized in this way as the environment is maintained in a secured manner. The exploitation of a microservice is as easy to start the execution of a new container. As a result, microservices could scale up by simply generating new containers until the required scalability level is attained. This paper aims to optimize the container allocation.

This paper introduces a new customized rider optimization algorithm (C-ROA) for optimizing the container allocation. The proposed model also considers the impact of system performance along with its security. Moreover, a new rescaled objective function is defined in this work that considers threshold distance, balanced cluster use, system failure, total network distance and security as well. At last, the performance of proposed work is compared over other state-of-the-art models with respect to convergence and cost analysis.

For experiment 1, the implemented model at 50th iteration has achieved minimal value, which is 29.24%, 24.48% and 21.11% better from velocity updated grey wolf optimisation (VU-GWO), whale random update assisted LA (WR-LA) and rider optimization algorithm (ROA), respectively. Similarly, on considering Experiment 2, the proposed model at 100th iteration attained superior performance than conventional models such as VU-GWO, WR-LA and ROA by 3.21%, 7.18% and 10.19%, respectively. The developed model for Experiment 3 at 100th iteration is 2.23%, 5.76% and 6.56% superior to VU-GWO, WR-LA and ROA.

This paper presents the latest fictional optimization algorithm named ROA for optimizing the container allocation. To the best of the authors’ knowledge, this is the first study that uses the C-ROA for optimization.

This paper aims to develop the Dragonfly-based exponential gravitational search algorithm to VMM strategy for effective load balancing in cloud computing. Due to widespread growth of cloud users, load balancing is the essential criterion to deal with the overload and underload problems of the physical servers. DEGSA-VMM is introduced, which calculates the optimized position to perform the virtual machine migration (VMM).

This paper presents an algorithm Dragonfly-based exponential gravitational search algorithm (DEGSA) that is based on the VMM strategy to migrate the virtual machines of the overloaded physical machine to the other physical machine keeping in mind the energy, migration cost, load and quality of service (QoS) constraints. For effective migration, a fitness function is provided, which selects the best fit that possess minimum energy, cost, load and maximum QoS contributing toward the maximum energy utilization.

For the performance analysis, the experimentation is performed with three setups, with Setup 1 composed of three physical machines with 12 virtual machines, Setup 2 composed of five physical machines and 19 virtual machines and Setup 3 composed of ten physical machines and 28 virtual machines. The performance parameters, namely, QoS, migration cost, load and energy, of the proposed work are compared over the other existing works. The proposed algorithm obtained maximum resource utilization with a good QoS at a rate of 0.19, and minimal migration cost at a rate of 0.015, and minimal energy at a rate of 0.26 with a minimal load at a rate of 0.1551, whereas with the existing methods like ant colony optimization (ACO), gravitational search algorithm (GSA) and exponential gravitational search algorithm, the values of QoS, load, migration cost and energy are 0.16, 0.1863, 0.023 and 0.29; 0.16, 0.1863, 0.023 and 0.28 and 0.18, 0.1657, 0.016 and 0.27, respectively.

This paper presents an algorithm named DEGSA based on VMM strategy to determine the optimum position to perform the VMM to achieve a better load balancing.

Data centres evolve constantly in size, complexity and power consumption. Energy-efficient scheduling in a cloud data centre is a critical and challenging research problem. It becomes essential to minimize the overall operational costs as well as environmental impact and to guarantee the service-level agreements for the services provided by the cloud data centres. Resource scheduling in cloud data centres is NP-hard and often requires substantial computational resources.

To overcome these problems, the authors propose a novel model that leads to nominal operational cost and energy consumption in cloud data centres. The authors propose an effective approach, parallel hybrid Jaya algorithm, that performs parallel processing of Jaya algorithm and genetic algorithm using multi-threading and shared memory for interchanging the information to enhance convergence premature rate and global exploration.

Experimental results reveal that the proposed approach reduces the power consumption in cloud data centres up to 38% and premature convergence rate up to 60% compared to other algorithms.

Experimental results reveals that our proposed approach reduces the power consumption in cloud data centres up to 38% and premature convergence rate up to 60% compared to other algorithms.

Purpose: Green computing is a way of using the computer resource in an eco-friendly while maintaining and decreasing the harmful environmental impact. Minimising toxic materials and reducing energy usage can also be used to recycle the product.

Need for the Study: The motivation of the study is to use green computing resources to decrease carbon emissions and their adverse effect on the environment.

Methodology: The study uses a qualitative method of collecting resources and data to address the opportunities, challenges, and future trends in green computing for Sustainable Future Technologies. The study focusses on multiple kinds of cloud computing services collected and executed into single remote servers. The service demand processor offers these services to the client per their needs. The simultaneous requests to access the cloud services, processing and expertly managing these requests by the processors are discussed and analysed.

Findings: The findings suggest that green computing is an upcoming and most promising area. The number of resources employed for green computing can be beneficial for lowering E-waste so that computing can be environmentally friendly and self-sustainable.

Practical Implications: Green computing applies across all industries and service sectors like healthcare, entertainment, tourism, and education. The convergence of technologies like Cloud Computing, AI, and Internet of Things (IoT) is greatly impacting Green Supply Chain Management (GSCM) market.

The cloud is a network of servers to share computing resources to run applications and data storage that offers services in various flavours, namely, infrastructure as a service, platform as a service and software as a service. The containers in the cloud are defined as “standalone and self-contained units that package software and its dependencies together”. Similar to virtual machines, the virtualization method facilitates the resource on a specific server that could be used by numerous appliances.

This study introduces a new Dragon Levy updated squirrel algorithm (DLU-SA) for container aware application scheduling. Furthermore, the solution of optimal resource allocation is attained via defining the objective function that considers certain criteria such as “total network distance (TND), system failure (SF), balanced cluster use (BC) and threshold distance (TD)”. Eventually, the supremacy of the presented model is confirmed over existing models in terms of cost and statistical analysis.

On observing the outcomes, the total cost of an adopted model for Experimentation 1 has attained a lesser cost value, and it was 0.97%, 10.45% and 10.37% superior to traditional velocity updated grey wolf (VU-GWO), squirrel search algorithm (SSA) and dragonfly algorithm (DA) models, respectively, for mean case scenario. Especially, under best case scenario, the implemented model has revealed a minimal cost value of 761.95, whereas, the compared models such as whale random update assisted lion algorithm, VU-GWO, SSA and DA has revealed higher cost value of 761.98, 779.46, 766.62 and 766.51, respectively. Thus, the enhancement of the developed model has been validated over the existing works.

This paper proposes a new DLU-SA for container aware application scheduling. This is the first work that uses the DLU-SA model for optimal container resource allocation by taking into consideration of certain constraints such as TND, SF, BC and TD.

Cloud computing (CC) refers to the usage of virtualization technology to share computing resources through the internet. Task scheduling (TS) is used to assign computational resources to requests that have a high volume of pending processing. CC relies on load balancing to ensure that resources like servers and virtual machines (VMs) running on real servers share the same amount of load. VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data.

VMs are an important part of virtualization, where physical servers are transformed into VM and act as physical servers during the process. It is possible that a user’s request or data transmission in a cloud data centre may be the reason for the VM to be under or overloaded with data. With a large number of VM or jobs, this method has a long makespan and is very difficult. A new idea to cloud loads without decreasing implementation time or resource consumption is therefore encouraged. Equilibrium optimization is used to cluster the VM into underloaded and overloaded VMs initially in this research. Underloading VMs is used to improve load balance and resource utilization in the second stage. The hybrid algorithm of BAT and the artificial bee colony (ABC) helps with TS using a multi-objective-based system. The VM manager performs VM migration decisions to provide load balance among physical machines (PMs). When a PM is overburdened and another PM is underburdened, the decision to migrate VMs is made based on the appropriate conditions. Balanced load and reduced energy usage in PMs are achieved in the former case. Manta ray foraging (MRF) is used to migrate VMs, and its decisions are based on a variety of factors.

The proposed approach provides the best possible scheduling for both VMs and PMs. To complete the task, improved whale optimization algorithm for Cloud TS has 42 s of completion time, enhanced multi-verse optimizer has 48 s, hybrid electro search with a genetic algorithm has 50 s, adaptive benefit factor-based symbiotic organisms search has 38 s and, finally, the proposed model has 30 s, which shows better performance of the proposed model.

User’s request or data transmission in a cloud data centre may cause the VMs to be under or overloaded with data. To identify the load on VM, initially EQ algorithm is used for clustering process. To figure out how well the proposed method works when the system is very busy by implementing hybrid algorithm called BAT–ABC. After the TS process, VM migration is occurred at the final stage, where optimal VM is identified by using MRF algorithm. The experimental analysis is carried out by using various metrics such as execution time, transmission time, makespan for various iterations, resource utilization and load fairness. With its system load, the metric gives load fairness. How load fairness is worked out depends on how long each task takes to do. It has been added that a cloud system may be able to achieve more load fairness if tasks take less time to finish.