Cloud Load Balancing using Meta-Heuristics

Cloud computing and big data: Technologies and applications

Cloud computing has become biggest buzz in the computer era these days. It runs entire operating systems on the cloud and do everything on cloud to store data off-site. Cloud computing is primarily based on grid computing, but it’s a new computational model. Cloud computing has emerged into a new opportunity to further enhance way of hosting data centre and provide services. The primary substance of cloud computing is to deal the computing power, storage, different sort of stages and services which assigned to the external users on demand through the internet. Task scheduling in cloud computing is vital role optimisation and effective dynamic resource allocation for load balancing. In cloud, the issue focused is under utilisation and over utilisation of the resources to distribute workload of multiple network links for example, when cloud clients try to access and send request to the same cloud server while the other cloud server remain idle at that moment, leads to the unbalanced of workload on cloud data centers. Thus, load balancing is to assign tasks to the individual cloud data centers of the shared system so that no single cloud data centers is overloaded or under loaded. A Hybrid approach of Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm is combined in order to get effective response time. The proposed hybrid algorithm has been experimented by using CloudSim simulator. The result shows that the hybrid load balancing algorithm improves the cloud system performance by reducing the response time compared to the Honey Bee (HB) and Particle Swarm Optimisation (PSO) load balancing algorithm. Â

This paper presents a hybrid approach based discrete Particle Swarm Optimization (PSO) and chaotic strategies for solving multi-objective task scheduling problem in cloud computing. The main purpose is to allocate the summited tasks to the available resources in the cloud environment with minimum makespan (i.e. schedule length) and processing cost while maximizing resource utilization without violating Service Level Agreement (SLA) among users and cloud providers. The main challenges faced by Particle Swarm Optimization (PSO) when used to solve scheduling problems are premature convergence and trapping into local optimum. This paper presents an enhanced Particle Swarm Optimization algorithm hybridized with Chaotic Map strategies. The proposed approach is called Enhanced Particle Swarm Optimization based Chaotic Strategies (EPSOCHO) algorithm. Our proposed approach suggests two Chaotic Map strategies: sinusoidal iterator and Lorenz attractor to enhanced PSO algorithm in order to get good convergence and diversity for optimizing the task scheduling in cloud computing. The proposed approach is simulated and implemented in Cloudsim simulator. The performance of the proposed approach is compared with the standard PSO algorithm, the improved PSO algorithm with Longest job to fastest processor (LJFP-PSO), and the improved PSO algorithm with minimum completion time (MCT-PSO) using different sizes of tasks and various benchmark datasets. The results clearly demonstrate the efficiency of the proposed approach in terms of makespan, processing cost and resources utilization.

Cloud computing provides the computational machines as a support of the clients utilizing cloud organize. In cloud computing, the user inputs are executed with required machines to convey the administrations. Numerous task scheduling methods are utilized to plan the client tasks to the machines. In this paper, another successful hybrid task scheduling is proposed to minimize the total execution time using Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) algorithms. In hybrid Genetic Algorithm - Particle Swarm Optimization (GA-PSO) algorithm, PSO helped GA to obtain better results compare to a standard genetic algorithm, Min-Min, and Max-Min algorithms results.

In the area of cloud computing load balancing, the Particle Swarm Optimization (PSO) algorithm is neoteric and now praised highly, but recently a more neoteric algorithm which deploys the classifier into load balancing is presented. Besides, an algorithm called red-black tree which is aiming at improving the efficiency of resource dispatching is also praised. But the 3 algorithms all have different disadvantages which cannot be ignored. For example, the dispatch efficiency of PSO algorithm is not satisfying; although classifier and red-black tree algorithm improve the efficiency of dispatching tasks, the performance in load balancing is not that good, as a result the improved PSO algorithm is presented. Some researches are designed to get the advantages of new algorithm. First of all, the time complexity and performance for each algorithm in theory are computed; and then actual data which are generated in experiments are given to demonstrate the performance. And from the experiment result, it can be found that for the speed of algorithm itself PSO is the lowest, and the improved PSO solve this problem in some degree; improved PSO algorithm has the best performance in task solving and PSO is the second one, the red-black and Naive Bayes algorithm are much slower; PSO and improved PSO algorithm perform well in load balancing, while the other two algorithms do not do well.

The flexibility of cloud computing to provide a dynamic and adaptable infrastructure in the context of information technology and service quality has made it one of the most challenging issues in the computer industry. Task scheduling is a major challenge in cloud computing. Scheduling tasks so that they may be processed by the most effective cloud network resources has been identified as a critical challenge for maximizing cloud computing’s performance. Due to the complexity of the issue and the size of the search space, random search techniques are often used to find a solution. Several algorithms have been offered as possible solutions to this issue. In this study, we employ a combination of the genetic algorithm (GA) and the gravitational emulation local search (GELS) algorithm to overcome the task scheduling issue in cloud computing. GA and the particle swarm optimization (PSO) algorithms are compared to the suggested algorithm to demonstrate its efficacy. The suggested algorithm outperforms the GA and PSO, as shown by the experiments.

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

Internet, since the beginning of its work, has undergone many changes one of the latest changes is how the internet cloud computing. New technologies cloud computing offers because of features all kinds of facilities to the users as a service. Each evolution, change and novel concept in the world of technologies has its own problems and complications. Accordingly, benefiting from cloud computing is no exception to this rule and it has challenged researchers and proponents in this research domain. Indeed, some major challenges in cloud computing are: load balancing, safety, reliability, ownership, data backup, data portability and supporting several platforms. One challenge for such matters in the field of cloud computing is load balancing optimization in the cloud. The so-called cloud computing, including virtualization, distributed computing, networking, software and Web services. With respect to the ever increasing significance of load balancing in cloud computing the researchers in this paper intended to improve load balancing by using a novel method. The related studies were reviewed, evaluated and compared with each other. The efficiency of the proposed method was analyzed and compared with those of other studies. The results of the present study revealed that the proposed method is better than other dynamic virtual machine (VM) consolidation algorithms in terms of reducing SLA (service levels agreement) violation and the amount of transmitted data volume transmission has to present a better performance than other methods.

Cloud load balancing is a key part of making sure that tasks are scheduled and resources are used in the best way possible in scalable cloud computing settings. This study suggests a way to improve load balancing that is based on nature and uses methods as Particle Swarm Optimization (PSO) and NIVM PSO Optimized (NIVM-PSO). By acting like natural processes, these programs can adapt to changing workloads and make sure that tasks are spread out evenly across computers. The goal of the suggested model is to cut down on reaction time, make the best use of resources, and boost system performance as a whole. The results of the experiments show that when compared to standard load balancing methods, they are much better at spreading out the load, lowering delay, and increasing speed. This nature-inspired method is a strong way to handle the complexity and demands of modern cloud systems. It creates a framework that can grow and work well for future cloud computing apps.

This paper objective to investigate the application of PSO for load balancing in cloud computing, optimize to solve the load balancing challenges in cloud environment and focus to distribute the workload across different virtual machines [1]. PSO is a metaheuristic optimization technique inspired by collective behavior of fish schooling and bird flocking., is used to explore the resource utilization and increase the system performance by redistribute the load across nodes. This study focuses to solve the challenges occurred during dynamic nature of cloud environment. Every node has its own capacity to handle the workload so various task scheduling algorithm applied to manage the workload. By using the load balancing approach maximize the global convergence with various parameter. In this research develops a robust load-balancing model that adopt to changing conditions and improves the responsiveness and efficiency of cloud services. Cloudsim simulator is also used to compare using PSO with various traditional algorithms.

Cloud computing provides computing resources like software and hardware as a service by the network for several users. Task scheduling is one of the main problems to attain cost-effective execution. The main purpose of task scheduling is to allocate tasks to resources so that it can optimize one or more criteria. Since the problem of task scheduling is one of the Nondeterministic Polynomial-time (NP)-hard problems, meta-heuristic algorithms have been widely employed for solving task scheduling problems. One of the new bio-inspired meta-algorithms is Seagull Optimization Algorithm (SOA). In this paper, we proposed an energy-aware and cost-efficient SOA-based Task Scheduling (SOATS) algorithm. The aims of proposed algorithm to make a trade-off between five objectives (i.e., energy consumption, makespan, cost, waiting time, and load balancing) using a fewer number of iterations. The experiment results by comparing with several meta-heuristic algorithms (i.e., Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and Whale Optimization Algorithm (WOA)) prove that the proposed technique performs better in solving task scheduling problem. Moreover, we compared the proposed algorithm with well-known scheduling methods: Cost-based Job Scheduling (CJS), Moth Search Algorithm based Differential Evolution (MSDE), and Fuzzy-GA (FUGE). In the heavily loaded environment, the SOATS algorithm improved energy consumption and cost saving by 10 and 25%, respectively.

It is our great pleasure to welcome you to BADS 2011, the third Workshop on Bio-Inspired and Self-* Algorithms for Distributed Systems, co-located with ICAC 2011, the 8th IEEE/ACM International Conferenceon Autonomic Computing, Karlsruhe, Germany, June 14-18, 2011. BADS 2011 aims to provide a forum for exploring bio-inspired and self-* algorithms to build autonomic distributed systems; i.e., self-managing distributed systems that can organize, configure, optimize, scale, protect and/or heal themselves with minimal human intervention. Computing inspired by biology has a long history since 1950s. Its common objectives are to formulate theoretical models that are faithfully designed after biological principles, phenomena and processes and to exploit the models for developing computational tools (e.g., algorithms) and systems. Well-known bio-inspired algorithms include artificial neural networks, evolutionary algorithms, swarm intelligence, artificial immune systems, reaction-diffusion algorithms, epidemic algorithms, cellular automata algorithms, gene expression/regulatory algorithms and Lindenmayer system. They have been successfully used as alternative and/or superior solutions to the problems that traditional algorithms cannot solve satisfactorily. In recognition of their achievements and potential, bio-inspired algorithms were named one of Scientific American magazine's 10 "World Changing Ideas 2010." The BADS workshop series focuses on distributed computing and examines the opportunities, current state-of-the-art, challenges and future outlook to create autonomic distributed systems with bio-inspired algorithms. We cover a broad range of aspects in distributed computing, including communication protocols, resource clustering, allocation and management, topology management, parallelism and concurrency, overlay construction and maintenance, decentralized information search and delivery, load distribution, synchronization, service selection, composition and deployment, labor division and task allocation, anomaly and misbehavior detection, malware propagation and detection. Following the success of its former editions in 2009 and 2010, BADS 2011 continues to focus on bio-inspired, autonomic distributed systems. In addition, it expands its themes to cover a general class of algorithms that exhibit self-* properties (e.g., self-configuring, self-organizing, self-managing, self-healing, self-scaling and selfadaptive properties) in the context of distributed computing. BADS 2011 has seven research papers selected through a rigorous review process. Each paper was reviewed and judged by at least three PC members on merits including correctness, originality, technical strength, quality of presentation and relevance to the workshop themes. We would like to sincerely thank the Program Committee members who have greatly contributed to the success of BADS 2011. BADS 2011 is organized in two sessions and one keynote presentation. The first session includes papers that present bio-inspired approaches for distributed computing. The second session focuses on solving optimization problems with distributed bio-inspired and self-* algorithms. The keynote presentation, entitled "Methods for Self-organizing Distributed Software", is given by Elisabetta Di Nitto, and focuses on the applications of self-organization in distributed systems. In nature, self-organization occurs such that a global behavior emerges from simple and local decisions made autonomously by each element of the system. This keynote overviews the benefits and challenges to apply the notion of self-organization for the development of distributed systems. It also presents several example applications such as energy efficiency and configuration optimization in cloud computing. The first session, "Bio-inspired Approaches for Distributed Computing", comprises four papers. The first paper, "Memetic Algorithm for Web Service Selection" by Ludwig, studies the service selection process, whose aim is to locate services of interest in service-oriented environments. The author proposes two approaches based on a genetic algorithm and a memetic algorithm to match consumers with services based on Quality of Service attributes. Both approaches are compared with an optimal assignment algorithm, called the Munkres algorithm, as well as with random approaches. The next paper, "OZMOS: Bio-Inspired Load Balancing in a Chord-based P2P Grid" by Brocco, proposes a load balancing mechanism, called Ozmos, that follows the principle of osmosis to relocate tasks between nodes in a P2P-based Grid. Bio-inspired agents are deployed to share information about the status of the Grid as well as to reschedule tasks between nodes. The efficacy of the proposed algorithm is illustrated in achieving system-wide load balance in Grids of different scales, with both homogenous and heterogeneous resources. The third paper, "Model-Driven Performance Engineering for Wireless Sensor Networks with Feature Modeling and Event Calculus" by Boonma and Suzuki, proposes an application development framework for wireless sensor networks. The proposed framework allows developers to graphically configure their applications and generate application code. With event calculus, the framework also estimates each application's performance such as per-node power consumption and network lifetime without running it on simulators and real networks. The proposed framework currently targets a shortest-path routing; however, it is a promising next step to estimate the performance of bio-inspired routing protocols such as pheromone-based chemotaxis routing. The last paper of the first session, "Description and Composition of Bio-Inspired Design Patterns: the Gradient Case" by Fernandez-Marquez, Arcos, Di Marzo Serugendo, Viroli and Montagna, investigates a group of bioinspired mechanisms in terms of design patterns. The authors show the relations between the different patterns and identify the boundaries of each mechanism. The mechanisms are organized into different levels. In basic level, Spreading, Aggregation and Evaporation are studied. Gradient is investigated in mid-level, and top-level mechanisms are Chemotaxis, Morphogenesis, and Quorum sensing. The second session, "Solving Optimization Problems with Distributed Evolutionary Algorithms", opens with a paper entitled "Protein Structure Prediction Using Particle Swarm Optimization and a Distributed Parallel Approach" by Kondov and Berlich. It demonstrates the efficiency of the standard Particle Swarm Optimization (PSO) algorithm to find the folded state of two proteins of different sizes starting from completely extended conformations. They illustrate that the predicted structure of the larger protein is in good agreement with the structure from the Protein Data Bank within the experimental resolution. The parallelization of PSO is shown to speed up the simulation linearly with the number of workers and it reduces the prediction time dramatically without loss of accuracy. The next paper, "Discrete Optimization Problem Solving with three Variants of Hybrid Binary Particle Swarm Optimization" by Singh V., Singh D., Tiwari and Shukla, presents three variants of the binary PSO algorithm in order to solve discrete optimization problems. This is achieved by introducing an additional step of crossover that varies in all the three variants. These hybrid algorithms show competitive results compared to other state-of-theart metaheuristics. The third paper, "Self-organized Invasive Parallel Optimization" by Mostaghim, Pfeiffer and Schmeck, proposes a new parallelization framework for optimization algorithms. In this approach, the self-organized resources are represented as a unified resource to the user who only specifies the optimization problem and his/her preferences to the system. The invasive approach starts with one resource and automatically divides the optimization task stepwise into smaller tasks, which are assigned to more resources. The job assignment pattern is decided on demand, i.e., the number of required resources is estimated during the optimization process. The authors examine their generic framework on multi-objective problems.

Cloud computing(CC), which utilizes massively virtualized data centers to deliver quick and affordable computing solutions, has developed ‎into an established industrial standard that is growing quickly. To handle such a massive amount of data effectively, cloud computing mostly ‎relies on automation and dynamic resource management. In cloud computing, load balancing (LB) is a vital technique for maximizing ‎resource utilization and making sure that no resource is used up. Without the requirement for physical infrastructure, cloud ‎LB allows online platforms to adjust their resources in response to traffic demands. In a cloud environment, workload and resource allocation entail determining the best way to divide up work among several servers. For increasingly severe uncertainty problems, traditional LB ‎approaches are simple but ineffective; for this reason, meta-heuristic methods are employed. This algorithm is heuristic and is independent ‎of the complexity of the challenges. Meta-heuristics approaches based on Artificial Intelligence (AI) are employed to analyze real-time data ‎and intelligently distribute workload among servers. This ensures efficient operations by preventing bottlenecks and enabling proactive LB ‎decisions. The review offers a thorough analysis of meta-heuristics techniques based on artificial intelligence (AI) for static and dynamic LB ‎in both homogeneous and heterogeneous cloud systems.

In Cloud Computing (CC) environment, load balancing refers to the process of optimizing resources of virtual machines. Load balancing in the CC environment is one of the analytical approaches utilized to ensure indistinguishable workload distribution and effective utilization of resources. This is because only by ensuring effective balance of dynamic workload results in higher user satisfaction and optimal allocation of resource, therefore improve cloud application performance. Moreover, a paramount objective of load balancing is task scheduling because surges in the number of clients utilizing cloud lead to inappropriate job scheduling. Hence, issues encircling task scheduling has to be addressed. In this work a method called, Ford Fulkerson and Newey West Regression-based Dynamic Load Balancing (FF-NWRDLB) in CC environment is proposed. The FF-NWRDLB method is split into two sections, namely, task scheduling and dynamic load balancing. First, Ford Fulkerson-based Task Scheduling is applied to the cloud user requested tasks obtained from Personal Cloud Dataset. Here, employing Ford Fulkerson function based on the flow of tasks, energy-efficient task scheduling is ensured. The execution of asymmetrical scientific applications can be smoothly influenced by an unbalanced workload distribution between computing resources. In this context load balancing signifies as one of the most significant solution to enhance utilization of resources. However, selecting the best accomplishing load balancing technique is not an insignificant piece of work. For example, selecting a load balancing model does not work in circumstances with dynamic behavior. In this context, a machine learning technique called, Newey West Regression-based dynamic load balancer is designed to balance the load in a dynamic manner at run time, therefore ensuring accurate data communication. The FF-NWRDLB method has been compared to recent algorithms that use the markov optimization and the prediction scheme to achieve load balancing. Our experimental results show that our proposed FF-NWRDLB method outperforms other state of the art schemes in terms of energy consumption, throughput, delay, bandwidth and task scheduling efficiency in CC environment.

The scheduling and distribution of tasks is one of the biggest problems with cloud computing, a platform that is becoming more and more popular for everyday use and financial applications. However, one of the main problems in the financial segment remains to be cloud security. Several studies have demonstrated that the financial cloud load balancing system manages the arrangement of n tasks in the process flow on cloud devices, which is critical to the effectiveness of the system. To research load balancing and dynamic task prioritization in financial cloud systems, a novel adaptive weighted round robin based versatile random forest (AWRR-VRF) strategy was suggested in this research. The suggested strategy uses the versatile random forest (VRF) method for dynamic task prioritization depending on security requirements and the adaptive weighted round robin (AWRR) approach for effective load balancing in the financial cloud. To categorize the task-oriented priority of requests and enable efficient task performance, the VRF is implemented based on user behavior patterns. Based on the suggested methodology, this research is carried out using the Python program and performance is examined in terms of CPU utilization (0.0100), energy consumption (62.675), task prioritization (77,600) and optimized memory usage (5102.50) measures. Task security is enhanced to minimize security threats and maximize the protection of financial data. By using the experimental assessment, this research determined that the suggested AWRR-VRF technique maximizes the financial cloud systems security and performance components.