EFFICIENT COMPUTATIONAL STRATEGY FOR CLOUD COMPUTING ENVIRONMENT

Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. This research work deals with the balancing of work load in cloud environment. Load balancing is one of the essential factors to enhance the working performance of the cloud service provider. It would consume a lot of cost to maintain load information, since the system is too huge to timely disperse load. Load balancing is one of the main challenges in cloud computing which is required to distribute the dynamic workload across multiple nodes to ensure that no single node is overwhelmed. It helps in optimal utilization of resources and hence in enhancing the performance of the system. We propose an improved load balancing algorithm for job scheduling in the cloud environment using load distribution table in which the current status, current package, VM Capacity and the number of cloudlets submitted to each and every virtual machine will be stored. Submit the job of the user to the datacenter broker. Data center broker will first find the suitable Vm according to the requirements of the cloudlet and will match and find the most suitable Vm according to its availability or the machine with least load in the distribution table. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. The main contributions of the research work is to balance the entire system load while trying to minimize the make span of a given set of jobs. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.

Cloud computing is distributed computing, storing, sharing and accessing data over the Internet. It provides a pool of shared resources to the users available on the basis of pay as you go service that means users pay only for those services which are used by him according to their access times. Load balancing ensures that no single node will be overloaded and used to distribute workload among multiple nodes. It helps to improve system performance and proper utilization of resources. We propose an improved load balancing algorithm for job scheduling in the cloud environment using K-Means clustering of cloudlets and virtual machines in the cloud environment. All the cloudlets given by the user are divided into 3 clusters depending upon client’s priority, cost and instruction length of the cloudlet. The virtual machines inside the datacenter hosts are also grouped into multiple clusters depending upon virtual machine capacity in terms of processor, memory, and bandwidth. Sorting is applied at both the ends to reduce the latency. Multiple number of experiments have been conducted by taking different configurations of cloudlets and virtual machine. Various parameters like waiting time, execution time, turnaround time and the usage cost have been computed inside the cloudsim environment to demonstrate the results. Compared with the other job scheduling algorithms, the improved load balancing algorithm can outperform them according to the experimental results.Â

In recent decades, task scheduling and load balancing in the cloud is a growing research area, due to the vast amount of data stored in the server highly increases the load. In order to address this concern, Hybrid Max-Min Genetic Algorithm (HMMGA) is proposed for task scheduling and load balancing in the cloud environment. At first, the load is evaluated for every Virtual Machine (VM), if the load is high, then HMMGA is used for balancing the load. HMMGA selects the best VMs to assign the tasks and migrates the over-loaded VMs tasks to the under-loaded VMs. HMMGA significantly avoids the imbalanced workload performance in the cloud environment. In this research paper, the proposed HMMGA performance is compared to Max-Min algorithm, Low time complexity and low cost binary Particle Swarm Optimizer (IBPSO-LBS) and PSO with Technique of Order Preference by Similarity to Ideal Solution (TOPSIS) algorithm to examine the efficacy of HMMGA. From the experimental simulation, the result shows that HMMGA averagely delivers 1.63 and 3.88 seconds less make span compared to the Max-Min and TOPSIS-PSO algorithm for five VMs. In addition, HMMGA averagely enhances 10% to 40% of resource utilization than the MaxMin and TOPSIS-PSO algorithm. In another experiment, the HMMGA approximately showed 1.7 to 25.99 seconds less average waiting time compared to the Max-Min and IBPSO-LBS.

Load Balancing is an important factor handling resource during running and execution time in real time applications. Virtual machines are used for dynamically access and share the resources. As per current scenario cloud computing is played major for storage, resource accessing, resource pooling and internet based service offering. Usage of cloud computing services is dynamically increased such as online shopping, education, ticketing, etc. Many users can use the cloud resources and load balancing is used for adjusting the virtual machine and balance the node. Our proposed virtualized genetic algorithms are to provide balanced virtual machine services in Hybrid cloud. The proposed algorithm and experiments are implemented by using Cloud simulator. In this paper the experiments are done with cloud computing models, Virtual Machine allocation, load balancing and simulations. Also compare the results using response time, throughput and turnaround time using cloud sim. The accuracy can be compared with existing load balancing techniques.

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.

Hybrid grey wolf and improved particle swarm optimization with adaptive intertial weight-based multi-dimensional learning strategy for load balancing in cloud environments

In cloud computing environment, the load balancing of non pre-emptive independent tasks is an important aspect of task scheduling. The tasks are executed on Virtual Machines (VMs) and these VMs are run in parallel so that the load has to be well balanced across all VMs. Since the cloud user pay for the service he/she is interested in reducing the execution time of task as well as the cost of using VM instances (CPU, Memory, Bandwidth etc). The proposed algorithm balance the load across VMs effectively by mapping tasks to under loaded or idle VMs based on the foraging behaviour of honey bees and if there is more than one under loaded VMs, it also selects cost efficient one using Pareto dominance strategy. The experimental results show that the algorithm is effective when compared with existing algorithms and it also reduces the cost of using VM instances.

Live virtual machine (VM) migration is a technique for achieving system load balancing in a cloud environment by transferring an active VM from one physical host to another. This technique has been proposed to reduce the downtime for migrating overloaded VMs, but it is still time- and cost-consuming, and a large amount of memory is involved in the migration process. To overcome these drawbacks, we propose a Task-based System Load Balancing method using Particle Swarm Optimization (TBSLB-PSO) that achieves system load balancing by only transferring extra tasks from an overloaded VM instead of migrating the entire overloaded VM. We also design an optimization model to migrate these extra tasks to the new host VMs by applying Particle Swarm Optimization (PSO). To evaluate the proposed method, we extend the cloud simulator (Cloudsim) package and use PSO as its task scheduling model. The simulation results show that the proposed TBSLB-PSO method significantly reduces the time taken for the load balancing process compared to traditional load balancing approaches. Furthermore, in our proposed approach the overloaded VMs will not be paused during the migration process, and there is no need to use the VM pre-copy process. Therefore, the TBSLB-PSO method will eliminate VM downtime and the risk of losing the last activity performed by a customer, and will increase the Quality of Service experienced by cloud customers.

Cloud computing(CC) delivers multiple services to users by processing complex tasks through internet connections to serve as a dynamic, dependable, and flexible computing solution. With the increased Internet speed, the user demands to perform many tasks through computing provided by cloud virtual machines (VMs) created in heterogeneous servers. The complexity of cloud computing(CC) increases through the diversity of servers and the increased demand for resources to perform more tasks, which makes the cloud data center(CDC) unbalanced in load. Therefore, future cloud systems will require more effective resource management(RM) methods to balance load and improve Quality of Service (QoS). This paper proposes KMPPVM-DRM, a dynamic clustering and scheduling approach for VM resource allocation(RA) based on the KMeans++ algorithm. VMs are clustered into three groups (high, medium, low) according to their real-time normalized CPU and RAM weights, using weighting parameters α = 0.6 and β = 0.4. Tasks are categorized into three levels based on length and mapped to appropriate VM clusters. Within each cluster, a Utilization-Level Comparator (ULC) dynamically selects the optimal VM for task execution. The experimental results were conducted using CloudSim, with 5 and 10 VMs and task counts ranging from 1000 to 10000. The proposed model was compared with PSO, ACO, and DBSCAN algorithms using execution time, average start time, and average finish time. Results show that with 10 VMs, the proposed model achieved a harmonic mean execution time of 886.72 ms, compared to 4102.99 ms (PSO), 4672.25 ms (ACO), and 3071.51 ms (DBSCAN). It also attained the lowest harmonic mean start and finish times of 166.41 ms and 167.19 ms, respectively. Relative reduction in execution time against DBSCAN ranged from 69.90% to 71.52%, with start and finish time improvements between 52.65% and 81.51%.To ensure statistical reliability, a paired t-test confirmed that the performance improvements were statistically significant (p < 0.05) across all task sizes. The findings confirm that KMPPVM-DRM enhances resource allocation(RA) efficiency and scheduling effectiveness, maintaining balanced loads even with limited resources (e.g., only 5 VMs) and outperforming PSO, ACO, and DBSCAN in all tested scenarios.

The rapid development of cloud computing expands the scale of modern cloud data centers, resulting in growing challenges of energy consumption. Load balancing of virtual machines(VMs), for the purposes of improving the utilization of physical resources and reducing energy consumption, has become a research focus in recent years. However, the existing researches mostly focus on how to maximize resource utilization and reduce energy consumption. Security issues in the context of load balancing of VMs were rarely addressed. In this paper, we research the key procedures of load balancing, VM selection and VM placement, we find that the existing schemes introduced several security problems. In consideration of some conclusions of recent researches and inevitable live migrations during load balancing, common tenants have sufficient reasons to worry about their VMs' security when they are migrated to strange hosts and/or co-reside with the VMs owned by strange tenants. In short, VMs' mobility introduced by load balance expands the attack surface. In this work, we classify and analyze related security threats and create an information leakage model for load balancing. We present a new security policy, SeLance, to secure the load balancing via avoiding above threats as far as possible. We develop exact implementations in CloudSim and OpenStack. We show that SeLance can effectively alleviate the threats introduced by load balancing, the security score can improve 46.90%-81.15%, while keeping the load balancer's original function to a great extent (± 2.5%).

Infrastructure as a Service (IaaS) cloud has been attracting more and more customers as it provides the highest level of flexibility by offering configurable virtual machines (VMs) and computing infrastructures. Public VM images are usually available for customers to customize and launch. However, the 1 to N mapping between VM images and running instances in IaaS makes vulnerabilities propagate rapidly across the entire public cloud. Besides, IaaS cloud naturally comes with a larger and more stable attack surface and more concentrated target resources than traditional surroundings. In this paper, we first identify the threat of exploiting prevalent vulnerabilities over public IaaS cloud with an empirical study in Amazon EC2. We find that attackers can compromise a considerable number of VMs with trivial cost. We then do a qualitative cost-effectiveness analysis of this threat. Our main result is a two-fold observation: in IaaS cloud, exploiting prevalent vulnerabilities is much more cost-effective than traditional in-house computing environment, therefore attackers have stronger incentive; Fortunately, on the other hand, cloud defenders (cloud providers and customers) also have much lower cost-loss ratio than in traditional environment, therefore they can be more effective for defending attacks. We then build a game-theoretic model and conduct a risk-gain analysis to compare exploiting and patching strategies under cloud and traditional computing environments. Our modeling indicates that under cloud environment, both attack and defense become less cost-effective as time goes by, and the earlier actioner can be more rewarding. We propose countermeasures against such threat in order to bridge the gap between current security situation and defending mechanisms. To our best knowledge, we are the first to analyze and model the threat with prevalent known-vulnerabilities in public cloud.

Cloud services are based on datacenter which provides resources on demand with higher capacity, lowest response time and improved resource utilization. The data center comprises of physical hosts which are effectively utilized in the form of Virtual Machines. The task scheduling problem is the mapping of tasks to suitable resources (VMs) as required and it is NP-hard problem. Further, the scheduling algorithms are followed by load balancing techniques for efficient utilization of VMs. In this paper a framework for Load balancing in Cloud Environment has been proposed and implemented for overflow and underflow VM identification. Two metaheuristics and one heuristic have been used in the proposed framework to achieve effective and efficient utilization of VMs in cloud environment. Further, the performance of the proposed framework has been analysed on the basis of makespan and cost metrics which are computed while executing scientific workflow tasks.

With the expansion of the cloud computing usage over a wide range of areas and different kinds of users, the cloud providers are taking full advantage of all their resources as much as they can. Memory is the most expensive resource in terms of oversubscribing and this has resulted in high price to the end user. Furthermore, performing swapping in Virtual Machines (VM) is expensive, so the cloud provider usually do not offer any swapping space for its systems. As a consequence, when a VM runs out of memory, user processes are killed. This scenario in the cloud environment is especially critical, since the user loses all of his/her execution time and, by extension, the money invested in this computation. This paper addresses this critical problem by providing a kernel extension that monitors the memory requirements of a VM and prevents the out of memory state by creating swapping space dynamically. The paper describes the design and implementation of a preliminary prototype of this kernel extensions and evaluates its performance.

Virtual machine (VM) images (VMIs) often share common parts of significant size as they are stored individually. Using existing de-duplication techniques for such images are non-trivial, impose serious technical challenges, and requires direct access to clouds' proprietary image storages, which is not always feasible. We propose an alternative approach to split images into shared parts, called fragments, which are stored only once. Our solution requires a reasonably small set of base images available in the cloud, and additionally only the increments will be stored without the contents of base images, providing significant storage space savings. Composite images consisting of a base image and one or more fragments are assembled on-demand at VM deployment. Our technique can be used in conjunction with practically any popular cloud solution, and the storage of fragments is independent of the proprietary image storage of the cloud provider.

Presently maintaining the load is the most challenging issue for a researcher in a cloud environment. In the IT sector, cloud computing is offering a variety of resources and free resources based on robust technology and Internet access in cloud computing. Users can also keep doing, gives a very reliable and inexpensive. Therefore, users of cloud computing are now evolving for every department of the organization, government and education for increased use of cloud services. Then, when they come in a variety of user demand for cloud resources, we can use load balancing technology to meet user needs. The use of the load balancing process is useful for distributing load over load to another node to adjust. The aim of load balancing is to balance virtual machines that should not be under load or overload. In this paper, propose two algorithms for the balance of load balancing algorithm including the workload of cloud system. In our work, there are basically low load systems and virtual machine demand will increase. The minimum finish time would be to put everything on one virtual machine and see the lowest number of high priority virtual machines. Improvements will be made to the importance of our research system, better use of resources and reduced full-time. Propose paper want the ClaudSim cloud platform to use a simulator. Also use unit response time in a VM as a metric, full implementation, and operation. Events demonstrate the features of the proposed algorithm running in a virtual machine to be used on experimental scale and for better application performance as possible.