Optimal Load Balancing Research Articles

Load balancing inside programmable data planes based on network modeling prediction using a GNN with network behaviors

In data center networks, existing control plane- and end host-based load-balancing methods are encumbered by excessively large decision delays during rapid reactions to microbursts. However, existing programmable data plane-based load balancing methods require large overheads involved in active probing. Accurate network modeling can optimize load balancing. However, existing modeling methods suffer from low generalization and high overhead. In this study, we propose a network modeling method based on a graph neural network (GNN) with basic network behavior (hereinafter called GNN-Behavior). This is derived from two inherent correlations observed: the correlation between global network behavior and basic network behavior and the correlation among basic network behaviors. We employed the GNN with an improved message-passing neural network to learn such two inherent correlations. Particularly, we considered modeling end-to-end delay as a use case to validate GNN-Behavior. Furthermore, we propose a packet-level load-balancing scheme inside programmable data planes (PDPs) based on the accurate prediction of end-to-end delay from the GNN-Behavior model(LBPP). LBPP is a control plane-PDP collaborative method that integrates a global view from a controller and quick response from switches. Experimental results demonstrate the feasibility and effectiveness of the GNN-Behavior and LBPP. Compared with queuing theory (QT), RouteNet, and GNN-based scheme, GNN-Behavior increases goodness of fit (R2) by 73.1%, 11.1%, and 3.74%, respectively. Under an unknown traffic control strategy, the generalization ability of GNN-Behavior is considerably better than that of QT and RouteNet. Compared with flow-level ECMP, flowlet-level LetFlow, and packet-level DRILL, LBPP can reduce average flow completion time by up to 43.9%, 37.4%, and 17.2%, respectively.

Hybrid dingo and whale optimization algorithm‐based optimal load balancing for cloud computing environment

AbstractCloud computing is the most rapidly growing technology that facilitates virtualized computer resources to the users through its service providers. Load balancing and task scheduling is the important concern in the cloud computing scenario from the service provider point of view. The process of load balancing is responsible for allocating the dynamic workload among the cloud systems, such that equal sharing of the resources without the virtual machines (VMs) being overloaded or underloaded. This load balancing process not only needs to allocate the tasks to suitable VMs but also need to maintain trade‐off among VMs. Thus, a potential dynamic and optimized load balancing strategy is essential for improving resource utilization, services, reliability, and throughput by maintaining equilibrium between VMs with minimized makespan. In this article, hybrid dingo and whale optimization algorithm‐based load balancing mechanism (HDWOA‐LBM) is proposed for effective load balancing those aids in maximized throughput, reliability, and resource utilization in the clouds. This HDWOA‐LBM is proposed by mimicking the hunting characteristics of dingo (equivalent to tasks) and VMs as their prey to be hunted. It inherited the process of exploration and exploitation through the chasing and approaching, encircling, and harassing inherent with dingo optimization algorithm (DOA) to determine the optimal allocation of incoming tasks to the suitable VM. In specific, it utilized the merits of whale optimization for improving the exploitation phase of DOA to balance the trade‐off between local and global search. The simulation experiments of the proposed HDWOA‐LBM conducted using CloudSim confirmed better throughput of 21.28%, maximized reliability of 25.42%, minimized makespan of 22.98%, and improved resource allocation of 20.86%, on par with the competitive intelligent load balancing schemes used for investigation.

Green Data Analytics of Supercomputing from Massive Sensor Networks: Does Workload Distribution Matter?

Energy costs represent a significant share of the total cost of ownership in high-performance computing systems. Using a unique data set collected by massive sensor networks in a petascale national supercomputing center, we first present an explanatory model to identify key factors affecting energy consumption in supercomputing. Our analytic results show that workload distribution among the nodes has significant effects and could effectively be leveraged to improve energy efficiency. We then establish the high model performance using in-sample and out-of-sample analyses and develop prescriptive models for energy-optimal runtime workload management. We present four dynamic resource management methodologies (packing, load balancing, threshold-based switching, and energy optimization), model their application at two levels (within-rack and cross-rack resource allocation), and explore runtime resource redistribution policies for jobs under the computational steering and comparatively evaluate strategies that use computational steering with those that do not. Our experimental results lead to a threshold strategy that yields near-optimal energy efficiency under all workload conditions. We further calibrate the energy-optimal resource allocations over the full range of workloads and present a bi-criteria evaluation to consider energy consumption and job performance tradeoffs. We conclude with implementation guidelines and policy insights into energy-efficient computing resource management in large supercomputing centers.

Intelligent and Collaborative Orchestration of Network Slices

5G and beyond network will support vertical industry applications, and the resource requirements of each service vary widely. The introduction of network slices provides great flexibility to the network, which can realize the differentiated customization requirements of service. However, while determining how to intelligently orchestrate the network slices is an important challenge, current solutions rarely treat multiple customized requirements of delay, bandwidth, load balancing, and slice isolation. In this article, network slice orchestration is considered from the perspective of slice isolation and cloud-edge collaboration. First, differentiated isolation level requirements are restricted to constraints, the customized isolation is realized. Second, bandwidth is saved and network latency is reduced via the collaboration of cloud and edge data centers. In addition, exclusive orchestration optimization objectives that match various service needs are proposed to distinguish the specific requirements of different slices. Finally, two deep reinforcement learning-based algorithms are proposed. The experimental results demonstrate that the proposed algorithms can optimize the objectives while ensuring differentiated isolation levels. For typical slices, the proposed algorithms respectively reduce bandwidth consumption by about 29% and 64%, reduce slice delay by about 14% and 70%, and optimize load balancing by about 17% and 23%.

An enhanced opportunistic rank-based parent node selection for sustainable & smart IoT networks

The Internet of Things (IoT) is a network of interconnected devices that includes low-end devices (sensors) and high-end devices (servers). The routing protocol used the Low-Power and Lossy Networks (RPL) protocol, which was designed to collect data in Low-Power and Lossy Networks (LLN) efficiently and reliably. The RPL rank property specifies how sensor nodes are placed in Destination Oriented Directed Acyclic Graphs (DODAG) based on an Objective Function (OF). The OF includes information such as the Expected Transmission Count (ETX) and packet delivery rate. The rank property aids in routing path optimization, reducing control overhead, and maintaining a loop-free topology by using rank-based data path validation. However, it causes many issues, such as optimal parent selection, next-hop node selection, and network instability. We proposed an Enhanced Opportunistic Rank-based Parent Node Selection for Sustainable and Smart IoT Networks to address these issues. The optimal parent node is determined by forecasting the expected energy of each node using Received Signal Strength (RSS) and an enhanced reinforcement learning algorithm. The proposed method addresses the issue of selecting the next-hop neighbor node and improves routing stability. Furthermore, when a large number of new nodes try to join the sustainable IoT-based smart cities, the proposed technique provides optimal load balance.

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.

A Sparse Distributed Gigascale Resolution Material Point Method

In this article, we present a four-layer distributed simulation system and its adaptation to the Material Point Method (MPM). The system is built upon a performance portable C++ programming model targeting major High-Performance-Computing (HPC) platforms. A key ingredient of our system is a hierarchical block-tile-cell sparse grid data structure that is distributable to an arbitrary number of Message Passing Interface (MPI) ranks. We additionally propose strategies for efficient dynamic load balance optimization to maximize the efficiency of MPI tasks. Our simulation pipeline can easily switch among backend programming models, including OpenMP and CUDA, and can be effortlessly dispatched onto supercomputers and the cloud. Finally, we construct benchmark experiments and ablation studies on supercomputers and consumer workstations in a local network to evaluate the scalability and load balancing criteria. We demonstrate massively parallel, highly scalable, and gigascale resolution MPM simulations of up to 1.01 billion particles for less than 323.25 seconds per frame with 8 OpenSSH-connected workstations.

A lightweight deep learning approach for COVID-19 detection using X-ray images with edge federation.

This study aims to develop a lightweight convolutional neural network-based edge federated learning architecture for COVID-19 detection using X-ray images, aiming to minimize computational cost, latency, and bandwidth requirements while preserving patient privacy. The proposed method uses an edge federated learning architecture to optimize task allocation and execution. Unlike in traditional edge networks where requests from fixed nodes are handled by nearby edge devices or remote clouds, the proposed model uses an intelligent broker within the federation to assess member edge cloudlets' parameters, such as resources and hop count, to make optimal decisions for task offloading. This approach enhances performance and privacy by placing tasks in closer proximity to the user. DenseNet is used for model training, with a depth of 60 and 357,482 parameters. This resource-aware distributed approach optimizes computing resource utilization within the edge-federated learning architecture. The experimental results demonstrate significant improvements in various performance metrics. The proposed method reduces training time by 53.1%, optimizes CPU and memory utilization by 17.5% and 33.6%, and maintains accurate COVID-19 detection capabilities without compromising the F1 score, demonstrating the efficiency and effectiveness of the lightweight convolutional neural network-based edge federated learning architecture. Existing studies predominantly concentrate on either privacy and accuracy or load balancing and energy optimization, with limited emphasis on training time. The proposed approach offers a comprehensive performance-centric solution that simultaneously addresses privacy, load balancing, and energy optimization while reducing training time, providing a more holistic and balanced solution for optimal system performance.

Hybrid Graph Partitioning with OLB Approach in Distributed Transactions

Online Transaction Processing (OLTP) gets support from data partitioning to achieve better performance and scalability. The primary objective of database and application developers is to provide scalable and reliable database systems. This research presents a novel method for data partitioning and load balancing for scalable transactions. Data is efficiently partitioned using the hybrid graph partitioning method. Optimized load balancing (OLB) approach is applied to calculate the weight factor, average workload, and partition efficiency. The presented approach is appropriate for various online data transaction applications. The quality of the proposed approach is examined using OLTP database benchmark. The performance of the proposed methodology significantly outperformed with respect to metrics like throughput, response time, and CPU utilization.

Artificial Intelligence Based Smart Routing in Software Defined Networks

In a non-static information exchange network, routing is an overly complex task to perform, which has to satisfy all the needs of the network. Software Defined Network (SDN) is the latest and widely used technology in the future communication networks, which would provide smart routing that is visible universally. The various features of routing are supported by the information centric network, which minimizes the congestion in the dataflow in a network and provides the content awareness through its mined mastery. Due to the advantages of the information centric network, the concepts of the information-centric network has been used in the paper to enable an optimal routing in the software-defined networks. Although there are many advantages in the information-centric network, there are some disadvantages due to the non-static communication properties, which affects the routing in SDN. In this regard, artificial intelligence methodology has been used in the proposed approach to solve these difficulties. A detailed analysis has been conducted to map the content awareness with deep learning and deep reinforcement learning with routing. The novel aligned internet investigation technique has been proposed to process the deep reinforcement learning. The performance evaluation of the proposed systems has been conducted among various existing approaches and results in optimal load balancing, usage of the bandwidth, and maximization in the throughput of the network.

Improved Whale Social Optimization Algorithm and deep fuzzy clustering for optimal and QoS-aware load balancing in cloud computing

Improved Whale Social Optimization Algorithm and deep fuzzy clustering for optimal and QoS-aware load balancing in cloud computing

Improved whale social optimisation algorithm and deep fuzzy clustering for optimal and QoS-aware load balancing in cloud computing

Improved whale social optimisation algorithm and deep fuzzy clustering for optimal and QoS-aware load balancing in cloud computing

Dynamic Migration Scheme for Load Balancing and Average Delay Optimization in SDN-Based Multi-UAV Relay Network

Dynamic Migration Scheme for Load Balancing and Average Delay Optimization in SDN-Based Multi-UAV Relay Network

Improved Round Robin Rule Learning for Optimal Load Balancing in Distributed Cloud Systems

Improved Round Robin Rule Learning for Optimal Load Balancing in Distributed Cloud Systems

Improved round-robin rule learning for optimal load balancing in distributed cloud systems

A newly emerging technology that distributes virtualised computer resources across the internet is referred to as 'cloud computing' and is gaining popularity. These clouds' ability to evenly distribute the load is vital. Load balancing in cloud computing distributes dynamic workloads so no database server is overcrowded or underloaded (LB). As a result, a dynamic load balancing technique in the cloud may contribute to improved service stability and resource utilisation. In this study, we model a load balancing system that balances the cloud's available resources using a rule-based round-robin method. Cloud parameters are used to calculate and allocate resources using a rule-based round-robin technique. The study analyses cloud metrics to determine cloud loads and resources. The cloud sim tool is used to allocate resources, and its effectiveness is tested against a variety of performance measures such as overhead, migration time, and throughput rate. Simulation results show that rule-based round-robin improves cloud performance. When compared to existing algorithms, the proposed methodology improves task performance by about 4%.

Fully-Decentralized Fairness-Aware Federated MEC Small-Cell Peer-Offloading for Enterprise Management Networks

In order to fit the requirements of future enterprise management networks with multiple service providers, conventional mobile edge computing enabled small cells (MEC-SCs) peer-offloading requires research efforts towards fully-decentralized computation-efficient global-optimal quality of service (QoS) aware load balancing, while ensuring service providers’ privacy protection. In this article, we propose a new fully-decentralized on-demand MEC-SC peer-offloading NETwork (named DEEP-NET), targeting QoS-aware load balancing with enhanced latency and service providers’ privacy protection. Newly developed federated gradient descent based algorithm is fully decentralized to MEC-SCs, which only requires local data and privacy-free inter-MEC-SC data sharing to achieve global optimal QoS-/latency-aware fairness. Result analysis for convergence of the proposed DEEP-NET provides guidance to the future topology optimization of fully-decentralized on-demand MEC-SC deployment. Besides, DEEP-NET outperforms the benchmarks with dynamic user demand to achieve optimal load balancing, with enhanced QoS, latency, and service providers’ privacy.

Self-Socio Adaptive Reliable Particle Swarm Optimization Load Balancing in Software-Defined Networking

Self-Socio Adaptive Reliable Particle Swarm Optimization Load Balancing in Software-Defined Networking

Retracted: Load Balancing Optimization of In‐Memory Database for Massive Information Processing of Internet of Things (IoTs)

Retracted: Load Balancing Optimization of In‐Memory Database for Massive Information Processing of Internet of Things (IoTs)

Salp swarm algorithm for optimal load balancing in low voltage networks

Distribution networks for low voltage (LV) are three-phase networks. It mostly serves single-phase end customers with a variety of load characteristics. Because each customer's load behavior differs, the current on the LV networks feeder is shared unequally, leading in an im-balance problem. This research investigates an efficient distribution of single-phase loads amongst three phase networks using the salp swarm algorithm (SSA) to phase swap consumers between phases. Customers are rearranged and their loads are switched from heavy to light to achieve phase shifting. Jordan's electricity distribution company (EDCO) has provided a full load feeder as a case study. The results of switching loads to a three-phase feeder show that the im-balance index and power losses can be decreased significantly.

Energy-Efficient Network Protocols and Resilient Data Transmission Schemes for Wireless Sensor Networks—An Experimental Survey

Wireless sensor networks (WSNs) are considerably used for various environmental sensing applications. The architecture and internal specifications of WSNs have been chosen based on the requirements of particular applications. On this basis, WSNs consist of resource (energy and memory)-limited wireless sensor nodes. WSNs initiate data communication from source to destination via physical layer management principles, channel slot scheduling principles (time division multiple access), wireless medium access control (WMAC) protocols, wireless routing protocols and application protocols. In this environment, the development of WMAC principles, routing protocols and channel allotment schemes play crucial roles in network communication phases. Consequently, these layering functions consume more energy at each sensor node, which leads to minimal network lifetime. Even though the channel management schemes, medium control protocols and routing protocols are functionally suitable, the excessive energy consumption affects the overall network performance. In this situation, energy optimization algorithms are advised to minimize the resource wastage of WSNs during regular operations (medium control and routing process). Many research works struggle to identify the optimal energy-efficient load balancing strategies to improve WSN functions. With this in mind, the proposed article has conducted a detailed literature review and notable experimental comparisons on energy-efficient MAC protocols, channel scheduling policies and energy-efficient routing protocols. To an extent, the detailed analysis over these wireless network operations helps to understand the benefits and limitations of recent research works. In the experimental section of this article, eight existing techniques are evaluated under energy optimization strategies (WMAC, channel allocation, sleep/wake protocols, integrated routing and WMAC policies, balanced routing and cooperative routing). The proposed review and the classified technical observations collected from notable recent works have been recognized as crucial contributions. The results infer the suggestions for feasible WSN communication strategies with optimal channel management policies and routing policies. Notably, the simulation results show that cross-layer or multi-layer energy optimization policies perform better than homogeneous energy optimization models.