Efficient Load Balancing Algorithms Research Articles

Joint Task Offloading, Resource Allocation, and Load-Balancing Optimization in Multi-UAV-Aided MEC Systems

Due to their limited computation capabilities and battery life, Internet of Things (IoT) networks face significant challenges in executing delay-sensitive and computation-intensive mobile applications and services. Therefore, the Unmanned Aerial Vehicle (UAV) mobile edge computing (MEC) paradigm offers low latency communication, computation, and storage capabilities, which makes it an attractive way to mitigate these limitations by offloading them. Nevertheless, the majority of the offloading schemes let IoT devices send their intensive tasks to the connected edge server, which predictably limits the performance gain due to overload. Therefore, in this paper, besides integrating task offloading and load balancing, we study the resource allocation problem for multi-tier UAV-aided MEC systems. First, an efficient load-balancing algorithm is designed for optimizing the load among ground MEC servers through the handover process as well as hovering UAVs over the crowded areas which are still loaded due to the fixed location of the ground base stations server (GBSs). Moreover, we formulate the joint task offloading, load balancing, and resource allocation as an integer problem to minimize the system cost. Furthermore, an efficient task offloading algorithm based on deep reinforcement learning techniques is proposed to derive the offloading solution. Finally, the experimental results show that the proposed approach not only has a fast convergence performance but also has a significantly lower system cost when compared to the benchmark approaches.

Efficient renewable energy-based geographical load balancing algorithms for green cloud computing

Efficient renewable energy-based geographical load balancing algorithms for green cloud computing

Empirical analysis of machine learning-based energy efficient cloud load balancing architectures: a quantitative perspective

Design of energy efficient load balancing models in cloud environments requires in-depth analysis of the cloud architecture and nature of requests served by the cloud. Depending upon these parameters, machine learning models are designed which aim at assigning best possible resource combination to serve the given tasks. This assignment varies w.r.t. multiple task and cloud parameters; which include task time, virtual machine (VM) performance, task deadline, energy consumption, etc. In order to perform this task, a wide variety of algorithms are developed by researchers cloud designers. Each of these algorithms aim at optimizing certain load balancing related parameters; for instance, a Genetic Algorithm (GA) designed for optimization of VM utilization might not consider task deadline before task allocation to the VMs. While, algorithms aimed at performing deadline aware load balancing might not provide effective cloud-to-task-mapping before allocation of tasks. Thus, it becomes difficult for researchers to select the best possible algorithms for their cloud deployment. In order to reduce this ambiguity, the underlying text compares different energy efficient cloud load balancing algorithms; and evaluates their performance in terms of computational complexity, and relative energy efficiency. This performance evaluation is further extended via inter architecture comparison; in order to evaluate the most optimum load balancer implementation for a given energy efficient application. Thus, after referring this text, researchers and cloud system designers will be able to select optimum algorithmic implementations for their given deployment. This will assist in reducing cloud deployment delay, and improving application specific load balancer performance.

Efficient Throttled load balancing algorithm to improve the response time and processing time in data center

SummaryIn today's world, cloud computing is an emerging service, and it has proved to be a profit‐oriented business model. A drastic growth was observed in cloud computing during the last decade because of its easy access to services. As the number of users are increasing dynamically, load balancing is required to handle the user's load. Load balancing algorithms minimize the data center processing time and increase the throughput. Therefore cloud service providers need the best dynamic strategies. In this work, the proposed Efficient Throttled load balancing algorithm improves the performance in the data center environment. Our experimental results indicate that the Efficient Throttled load balancing algorithm improves the average overall response time by 6.47% and average data center processing time by 20.74%, compared to the Throttled load balancing algorithm.

A New Fault-Tolerant Algorithm Based on Replication and Preemptive Migration in Cloud Computing

Cloud computing is a promising paradigm that provides users higher computation advantages in terms of cost, flexibility, and availability. Nevertheless, with potentially thousands of connected machines, faults become more frequent. Consequently, fault-tolerant load balancing becomes necessary in order to optimize resources utilization while ensuring the reliability of the system. Common fault tolerance techniques in cloud computing have been proposed in the literature. However, they suffer from several shortcomings: some fault tolerance techniques use checkpoint-recovery which increases the average waiting time and thus the mean response time. While other models rely on task replication which reduces the cloud's efficiency in terms of resource utilization under variable loads. To address these deficiencies, an efficient and adaptive fault tolerant algorithm for load balancing is proposed. Based on the CloudSim simulator, some series of test-bed scenarios are considered to assess the behavior of the proposed algorithm.

Load balancing using dynamic algorithms for cloud environment: A survey

Numerous researchers have worked on different load balancing algorithms in cloud Environment. But, no efficient algorithm for load balancing in cloud environment is developed yet. For optimizing the solution and fully utilizing the resources authors moved to the nature inspired algorithms. This paper presents a survey of different dynamic and nature inspired algorithms with their advantages and disadvantages. The objective of this study is to bring out the conclusion that disadvantages of various nature inspired algorithms can be overcome if different algorithms can be used as a hybrid to suit the usage of application and new optimization technique can be formulated by the combination of two or more algorithm. Researchers are also proposing a new hybrid technic which is more effective and robust and will try to balance the load without being complex. Proposed algorithm will use Ant Colony and Bird swarm Optimization techniques through which the degree of imbalance will be reduced. By using the proper fitness function makespan can be minimized and resource utilization can be maximized. Good part of the Ant colony optimization and Bird Swarm optimization is that by using these algorithms best optimal solution can be find out and both can be suited for static and dynamic environment and adaptive as well.

A Distributed Fault Tolerant Algorithm for Load Balancing in Cloud Computing Environments

Cloud computing is a promising paradigm that provides users with higher computing benefits in terms of cost, availability and flexibility. Nevertheless, with potentially thousands of connected machines, faults become more frequent and may have an adverse effect on the application. Consequently, fault-tolerant load balancing becomes necessary in order to optimize resource utilization while ensuring the reliability of the system. Different approaches have been proposed in the literature for fault tolerance in cloud computing. However, they suffer from several shortcomings: some fault tolerance techniques use task replication which reduce the cloud’s efficiency in terms of resource utilization. While other models rely on checkpoint recovery to tolerate failures, resulting in an increase in the mean response time. To address these shortcomings, an efficient and adaptive fault tolerant algorithm for load balancing is proposed. Based on the CloudSim simulator, some series of test-bed scenarios are considered to assess the behavior of the proposed algorithm.

A Novel Approach for Securing Nodes Using Two-Ray Model and Shadow Effects in Flying Ad-Hoc Network

In the last decades, flying ad-hoc networks (FANET) have provided unique features in the field of unmanned aerial vehicles (UAVs). This work intends to propose an efficient algorithm for secure load balancing in FANET. It is performed with the combination of the firefly algorithm and radio propagation model. To provide the optimal path and to improve the data communication of different nodes, two-ray and shadow fading models are used, which secured the multiple UAVs in some high-level applications. The performance analysis of the proposed efficient optimization technique is compared in terms of packet loss, throughput, end-to-end delay, and routing overhead. Simulation results showed that the secure firefly algorithm and radio propagation models demonstrated the least packet loss, maximum throughput, least delay, and least overhead compared with other existing techniques and models.

Efficient Load Balancing Algorithm in Long Term Evolution (LTE) Heterogeneous Network Based on Dynamic Cell Range Expansion Bias

The traditional scheme for load balancing in a homogeneous Long Term Evolution (LTE) Network where User Equipment (UEs) associate to a node with the strongest received signal strength is not practical for LTE Heterogeneous Network (LTE HetNet) due to power disparity between the nodes. Therefore, dynamic Cell Range Expansion (CRE) based load-balancing schemes were employed by several scholars to address the challenges in the LTE HetNet. However, the fairness index in achieving the desired average user throughput and UE offloading effect is relatively low. In this work, an efficient load-balancing algorithm for LTE HetNet based on dynamic Cell Range Expansion (CRE) was developed to improve the fairness of the network for the desired throughput and UE offloading effect. The simulation results achieve a throughput gain improvement of up to 11%, while the fairness index improves by 6% compared to the existing algorithm. Further, the UEs offloading effect shows a significant improvement of 3% relative to the existing algorithm.
 Keywords: Fairness Index; Cell Range Expansion; Load Balancing; LTE Heterogeneous Network; Throughput

Traffic-aware adaptive server load balancing for software defined networks

Servers in data center networks handle heterogenous bulk loads. Load balancing, therefore, plays an important role in optimizing network bandwidth and minimizing response time. A complete knowledge of the current network status is needed to provide a stable load in the network. The process of network status catalog in a traditional network needs additional processing which increases complexity, whereas, in software defined networking, the control plane monitors the overall working of the network continuously. Hence it is decided to propose an efficient load balancing algorithm that adapts SDN. This paper proposes an efficient algorithm TA-ASLB-traffic-aware adaptive server load balancing to balance the flows to the servers in a data center network. It works based on two parameters, residual bandwidth, and server capacity. It detects the elephant flows and forwards them towards the optimal server where it can be processed quickly. It has been tested with the Mininet simulator and gave considerably better results compared to the existing server load balancing algorithms in the floodlight controller. After experimentation and analysis, it is understood that the method provides comparatively better results than the existing load balancing algorithms.

A comparative study of energy and task efficient load balancing algorithms in cloud computing

The future growth of the Internet of Services has fundamentally changed the emergence of cloud computing. Cloud data centres serve multiple tenant demands for cloud applications that discharge vast amounts of electricity, leading to high operating costs and environmental diffusion of carbon dioxide (CO2). To fix this is the need for preservation to enable potential use by building a new structure and measuring the effect in a cloud data centre. Consequently, the use of pruned electricity reduces the cost of processing power. In order to meet energy-efficient data centres in the cloud, adjusting to optimal load balancing processing a good way for energy savings. To minimise the large energy use of cloud data centres herds, this focuses on increasing efficacy by breaking the workload evenly. In this paper, we plan to provide a comprehensive comparative analysis in cloud computing of current load balancing algorithms.

Load Balancing Problem on Hyper Hexa Cell Interconnection Network

Dynamic load balancing techniques prevents computer nodes from overloading unevenly while leaving other idle. It is considered as one of the most challenging topics in parallel computing. Moreover, it is essential for increasing the efficiency of highly parallel systems especially in solving multitask problems with unpredictable load estimates. Particularly, over each processor in the parallel systems and interconnection networks. This paper focuses on developing an efficient algorithm for load balancing on Hyper Hexa Cell (HHC) interconnection network, namely, HHCLB algorithm. Basically, the Dimension Exchange Method (DEM) approach is used in this paper to construct a new load balancing approach on the network of HHC interconnections. Thus, an algorithm was introduced and simulated using java threads, where the performance of the algorithm is evaluated both analytically and experimentally. The evaluation was in terms of various performance metrics, including, execution time, load balancing accuracy, communication cost. By implementing the proposed load balancing algorithm to the HHC network, a high degree of accuracy and minimal execution time was achieved. It is important to highlight that the algorithm recorded small gap between the execution time for small number of processors and large number of processors. For instance, the algorithm achieved 0.14 seconds for balancing the load of 6 processors while 0.59 seconds for balancing the load of 3072 processors. This proves how effective the algorithm is in balancing the load for different network sizes from small to large number of processors, with a slight difference in execution time.

A Comprehensive Study of Load Balancing Approaches in the Cloud Computing Environment and a Novel Fault Tolerance Approach

The past few years have witnessed the emergence of a novel paradigm called cloud computing. CC aims to provide computation and resources over the internet via dynamic provisioning of services. There are several challenges and issues associated with implementation of CC. This research paper deliberates on one of CC main problems i.e. load balancing (LB). The goal of LB is equilibrating the computation on the cloud servers such that no host is under/ overloaded. Several LB algorithms have been implemented in literature to provide effective administration and satisfying customer requests for appropriate cloud nodes, to improve the overall efficiency of cloud services, and to provide the end user with more satisfaction. An efficient LB algorithm improves efficiency and asset's usage through effectively spreading the workload across the system's different nodes. This review research paper objective is to present critical study of existing techniques of LB, to discuss various LB parameters i.e. throughput, performance, migration time, response time, overhead, resource usage, scalability, fault tolerance, power savings, etc. The research paper also discusses the problems of LB in the CC environment and identifies the need for a novel LB algorithm that employs FT metrics. It has been found that traditional LB algorithms are not good enough and they do not consider FT efficiency metrics for their operation. Hence, the research paper identifies the need for FT efficiency metric in LB algorithms which is one of the main concerns in cloud environments. A novel algorithm that employs FT in LB is therefore proposed.

Optimization Load Balancing Over an Imbalance Datacenter Topologies

The quick demand of cloud resources, responsible for design a highly dynamic and flexible Cloud, has become a main challenge in datacenter deployment.A huge number of virtual machines will be available in Datacenter. Further Datacenter will be divided into a greater number of clusters. Each cluster is grouped to same type of Virtual machines. The virtual machines inside the cluster is homogeneous and heterogeneous to other cluster. Any virtual machine can be allocated to end user. If an unhealthy and less energy virtual machine is allocated to user, it will completely degrade the performance of the machine. To overcome this issue, we use an efficient load-balancing algorithm to allocate virtual machine to end user. The Fuzzy Optimized load-balancing algorithm uses the bandwidth, memory, CPU utilization are the key metrics. An efficient algorithm increases the number of hosts allocated to each end user.

A generic formal model for the comparison and analysis of distributed job-scheduling algorithms in grid environment

Nowadays, high-end Systems consist of thousands of individual devices which are in general heterogeneous. Grid computing environments are an example of high-end systems which are composed of many diverse and heterogeneous resources distributed within multiple geographical areas. The performance of such systems depends considerably on job scheduling and resource allocation algorithms. Indeed, to improve the global throughput of these environments, effective and efficient load balancing algorithms are fundamentally important. In this paper, we propose a completely distributed formal model for the description of grid architecture. Our model, is then parameterized to describe different job-scheduling algorithms in a completely parallel architecture. In particular, we focus on the modeling and description of distributed load-balancing algorithms. To reach this purpose, we define a set of parallel schedulers communicating together to achieve a given load-balancing policy. To show the applicability of our approach, we propose to specify and compare different well-known job-scheduling policies in grid environments. The formal verification of different properties of the studied protocols has been performed automatically using Model-checking and a set of performance analysis results are also provided.

Dynamic load balancing with tokens

Efficiently exploiting the resources of data centers is a complex task that requires efficient and reliable load balancing and resource allocation algorithms. The former are in charge of assigning jobs to servers upon their arrival in the system, while the latter are responsible for sharing the server resources between their assigned jobs. These algorithms should adapt to various constraints, such as data locality, that restrict the feasible job assignments. In this paper, we propose a token-based algorithm that efficiently balances the load between the servers without requiring any knowledge on the job arrival rates and the server capacities. Assuming a balanced fair sharing of the server resources, we show that the resulting dynamic load balancing is insensitive to the job size distribution. Its performance is compared to that obtained under the best static load balancing and in an ideal system that would constantly optimize the resource utilization. We also make the connection with other token-based algorithms such as Join-Idle-Queue.

Hierarchical Edge-Cloud SDN Controller System With Optimal Adaptive Resource Allocation for Load-Balancing

Although the openflow-based software defined network (SDN) architecture can ease the workload of network control and management and separate it from the switch/routing operations, a computation-resource limited controller can still be congested by heavy flows and then experiences serious delay. To enhance network scalability and reduce computation delay on SDN networks under Quality of Service (QoS) requirements, a hierarchical edge-cloud SDN (HECSDN) controller system design is proposed with three features. First, by sharing computational resources in the edge and the cloud, the system architecture provides a flexible mechanism for devices to allocate their computational tasks according to traffic loads. The second feature is to design a queueing model of the proposed architecture. The model description of the networking architecture enables the network designers to quickly estimate the performance of design without considerable time and cost in experimental setups. Third, derived from the queueing model, an efficient load-balancing algorithm satisfying QoS requirements or fairness allocation for different applications in the HECSDN architecture is proposed. This newly-developed multi-tier controller system has been proved to be effective even when working on a large-scale SDN, without sacrificing the overall performance. Moreover, this system stays highly stable in transient periods even under highly fluctuating flow arrivals.

A Load-Balance System Design of Microgrid Cluster Based on Hierarchical Petri Nets

In the new paradigm of urban microgrids, load-balancing control becomes essential to ensure the balance and quality of energy consumption. Thus, phase-load balance method becomes an alternative solution in the absence of distributed generation sources. Development of efficient and robust load-balancing control algorithms becomes useful for guaranteeing the load balance between phases and consumers, as well as to establish an automatic integration between the secondary grid and the supervisory center. This article presents a new phase-balancing control model based on hierarchical Petri nets (PNs) to encapsulate procedures and subroutines, and to verify the properties of a combined algorithm system, identifying the load imbalance in phases and improving the selection process of single-phase consumer units for switching, which is based on load-imbalance level and its future state of load consumption. A reliable flow of automated procedures is obtained, which effectively guarantees the load equalization in the low-voltage grid.

A Comparative Study of Task Scheduling and Load Balancing Techniques with MCT using ETC on Computational Grids

Objectives: In this paper various task scheduling algorithm along with load distribution techniques investigated to ensure efficient mapping of tasks to resources and for coherent resource utilization in heterogeneous environment. Statistical Analysis: A detailed comparative approach is conferred for different job scheduling and load balancing algorithm available in the literature. Considered parameters for comparisons are scheduling approaches, techniques, findings, benefits, pros and cons. This study facilitates to identify the efficient scheduling and load balancing approach which optimizes resource use, minimizes completion time as well as task waiting time and balanced load among resources. Findings: Make span time and flow time are two important parameters to compute and minimize job execution time. This paper explores an intense survey of minimization of task execution time with minimum make span time and flow time. Apart from this a joint review on job scheduling, load balancing and minimizing job completion time using Expected Time to Compute (ETC) matrix is presented. At the end of this paper a research model is proposed which is a novel and hybrid approach with a combination of the efficiency of scheduling and load balancing. Application: The Load Balancing (LB) is an important feature of the grid environment. The efficient LB algorithm assures cost effective resource usage by the provisioning of resources to users on demand schedule in pay-as-you-say-manner.

Performance analysis of dynamic load balancing algorithm for multiprocessor interconnection network

Summary Multiprocessor interconnection network have become powerful parallel computing system for real-time applications. Nowadays the many researchers posses studies on the dynamic load balancing in multiprocessor system. Load balancing is the method of dividing the total load among the processors of the distributed system to progress task's response time as well as resource utilization whereas ignoring a condition where few processors are overloaded or underloaded or moderately loaded. However, in dynamic load balancing algorithm presumes no priori information about behaviour of tasks or the global state of the system. There are numerous issues while designing an efficient dynamic load balancing algorithm that involves utilization of system, amount of information transferred among processors, selection of tasks for migration, load evaluation, comparison of load levels and many more. This paper enlightens the performance analysis on dynamic load balancing strategy (DLBS) algorithm, used for hypercube network in multiprocessor system.