Load Balancing System Research Articles

IoT Enabled Intelligent Load Balancing System for Railway Wagons through Artificial Intelligence

This research paper presents an innovative system that integrates IoT (Internet of Things) and AI (Artificial Intelligence) technologies to address the critical issue of load balancing in railway wagons. Traditional systems focus on post-event detection of overloading or under loading, which poses safety risks and inefficiencies. In contrast, our solution leverages IoT-enabled load cells to continuously monitor wagon loads in real-time and utilizes AI-driven algorithms such as Genetic Algorithms and Reinforcement Learning—to optimize load distribution dynamically. The system ensures balanced loading across wagons, preventing overloading and underutilization, improving safety, fuel efficiency, and operational effectiveness. The IoT sensors provide real-time data that is processed by AI models to predict and balance load allocation, thus minimizing the risk of infrastructural damage and enhancing wagon capacity utilization. Initial testing shows a 95%reduction in load imbalances, a 20% decrease in loading time, and improved fuel economy by 10%. This research contributes to railway freight logistics by offering an AI- powered solution for intelligent load management, ensuring safety, efficiency, and cost-effectiveness.

Efficient slicing scheme and cache optimization strategy for structured dependent tasks in intelligent transportation scenarios

The challenges posed by structured large-scale tasks to resource-sensitive intelligent transportation systems have been acknowledged, particularly regarding the need to reduce delay and energy consumption during the caching and offloading processes. To address these challenges and improve the quality of service for vehicular users, a cloud–edge-end collaboration caching strategy (CACCSC) based on structured task content awareness was proposed in this paper. The dependencies among task fragments were modeled through fuzzy judgment criteria. In addition, a system delay model, an energy consumption model, and an edge server load balancing model were developed, along with a multi-objective optimization model that integrates system delay, energy consumption, and edge server load balancing variance. To solve this multi-objective optimization problem, an adaptive multi-objective optimization algorithm (MDE-NSGA-III) was developed, which combines an enhanced version of the Differential Evolution algorithm with improvements to the NSGA-III algorithm. Finally, it has been demonstrated through simulation experiments that when the number of users in the system reaches 35, the system delay, energy consumption, and load balancing variance of the MDE-NSGA-III optimization scheme proposed in this paper are 6.1%, 6.6%, and 25% lower than those of the NSGA-III scheme, 15.8%, 10%, and 41.7% lower than those of the NSGA-II scheme, and 62.7%, 20.7%, and 8.3% lower than those of the PeEA scheme.

A power grid topology detection method based on edge graph attention neural network

Against the backdrop of growing power demand and market liberalization, operators optimize power transmission and system load balance through network reconfiguration by switching lines. However, the complex node connections and dynamic load variations exceed the capabilities of traditional algorithms, and data noise may cause detection errors, affecting grid dispatch and stability. To address this issue, a solution is proposed based on the Edge Graph Attention Neural Network (EGAT) model, providing an in-depth analysis of the reconfigured grid structure. The model employs a multi-head attention mechanism to integrate node and edge features from different layers, enhancing feature fusion and extracting critical topological information, thereby improving the accuracy and robustness of grid topology detection after reconfiguration. The method was tested on IEEE 14-bus, IEEE 39-bus, and IEEE 118-bus systems, achieving detection accuracies of 92.30 %, 90.14 %, and 87.25 %, respectively, significantly outperforming other neural network methods. However, the complexity of the model may result in additional computational overhead.

Dynamically Balancing Load with Overload Control for Microservices

The microservices architecture simplifies application development by breaking monolithic applications into manageable microservices. However, this distributed microservice “service mesh” leads to new challenges due to the more complex application topology. Particularly, each service component scales up and down independently creating load imbalance problems on shared backend services accessed by multiple components. Traditional load balancing algorithms do not port over well to a distributed microservice architecture where load balancers are deployed client-side. In this article, we propose a self-managing load balancing system, BLOC, which provides consistent response times to users without using a centralized metadata store or explicit messaging between nodes. BLOC uses overload control approaches to provide feedback to the load balancers. We show that this performs significantly better in solving the incast problem in microservice architectures. A critical component of BLOC is the dynamic capacity estimation algorithm. We show that a well-tuned capacity estimate can outperform even join-the-shortest-queue, a nearly optimal algorithm, while a reasonable dynamic estimate still outperforms Least Connection, a distributed implementation of join-the-shortest-queue. Evaluating this framework, we found that BLOC improves the response time distribution range, between the 10th and 90th percentiles, by 2 –4 times and the tail, 99th percentile, latency by 2 times.

Real Time Prediction and Modelling of Power Grid System Stability and Load Balancing

Abstract The extensive geographical distribution of the power system determines its highly complex structure. The system includes key components such as generators, substations, transmission and distribution grids, and users. This system has characteristics such as nonlinearity, time-varying, and parameter uncertainty. Power system stability is inherently linked to its regular operational performance. This article uses Simulink models to simulate the working state of generators and circuit breakers during faults. Under the conditions of a synchronous generator with a rated power of 350MW, a voltage of 10.5KV, a three-phase parallel RLC load rated voltage of 115KV, and a power consumption of 300MW, when a short occurs on line, the speed and relative angle of the generator tend to a fixed value, and the system remains stable. When a fault occurs in the circuit within 0.1 seconds, the circuit breaker will cut off the faulty line within 0.6 seconds. Avoiding the occurrence of oscillations and unstable states in typical dynamic systems.

Network Traffic Feature Behaviour Augmentation Fusion based Attacks Classification for Intrusion Detection System in SDN Framework

The implementation of Software-Defined Network(SDN) across multiple data centers aims to simplify thecontrol and management of networks. However, the increasingpopularity of SDN has also attracted the attention of attackers.To tackle this problem, it is essential to have an intrusiondetection system (IDS) in place, which plays a crucial role incybersecurity by addressing external threats. The advantageof SDN’s centralized nature is that it facilitates the training ofan IDS based on machine learning. However, there is a scarcityof research specifically focused on intrusion detection in SDN.Existing literature often treats SDN intrusion detection assimilar to traditional computer systems and relies on intrusiondatasets generated for those systems. We explore the issueof intrusion detection in SDN using the most recent publicdataset (InSDN). However, InSDN is an imbalanced data set.In this paper, we have recommended a method to balance thedata as well as a method to find the best features to improvethe quality of IDS using Machine Learning. In addition, wealso suggest a method of classifying SDN network traffic andnormal network traffic. At the same time, we also evaluate theefficiency of the SDN system with the load balancing systemand without the load balancing system.

A particle swarm optimization inspired global and local stability driven predictive load balancing strategy

In distributed systems and parallel computing, optimal load balancing is difficult. These abstract addresses load balancing in distributed situations, highlighting current solutions' flaws and emphasizing the need for new ones. Load balancing research includes centralized and distributed algorithms, heuristics, and predictive models. Despite various successful methods, workload adaptability, overhead reduction, and scaling to large systems remain unresolved. This study proposes a particle swarm optimization (PSO) load balancing method that considers global and local stability considerations. The proposed method uses PSO principles to balance exploration and exploitation and allocate resources among distributed nodes. Predictive components improve preventative load management by predicting workload changes. Global and local load balancing stability criteria distinguish this study. The recommended method considers global system-wide performance indicators, local node-level characteristics, and micro-level stability to maximize system efficiency. A dual-focus technique distinguishes the proposed load balancing strategy from others, solving dynamic distributed system challenges. The study examines load balancing system advances and suggests improvements and further research. More accurate prediction modeling, stability measures, and application-specific enhancements may be studied in the future. Experimental validation and real-world implementation of the recommended approach are necessary to determine its practicality and ability to handle modern distributed computing systems.

The optimization problem of system load balancing and its solution for industrial Internet-of-Things data management

The optimization problem of system load balancing and its solution for industrial Internet-of-Things data management

X-Stor: A Cloud-Native NoSQL Database Service with Multi-Model Support

In recent years at Tencent, we have observed that the use of multiple NoSQL databases for storing business data with diverse models has led to increased programming and deployment costs, as well as inefficient maintenance and underutilized resources. In this paper, we report X-Stor, a cloud-native NoSQL database system that supports multiple data models by extending different storage engines and efficiently managing them through a unified control plane. This design significantly reduces expenses and enables rapid expansion of new models, while seamlessly supporting their complete functionality through storage engine extensions. By consolidating multi-tenant services and data models on the same physical machines, X-Stor significantly enhances the utilization of cluster resources. Additionally, X-Stor introduces a standardized metric called Request Unit (RU) to measure tenant resource consumption for consumption-based pricing purposes. Leveraging this metric, we design RU-based resource management strategies and achieve efficient multi-tenant resource isolation and system load balancing. Currently, X-Stor manages a storage capacity of over 12PB for online operational data, including more than 100,000 tables with multiple data models. It handles 700 billion requests per day with a peak of 30 million requests per second. We evaluate the performance of X-Stor on popular benchmarks and production workloads. The results show that X-Stor performs well under diverse data models.

Adaptive firefly algorithm for resource allocation and modified advanced encryption standard algorithm for hypervisor attack detection on cloud computing

Introduction: The advantages and wide-ranging applications of cloud computing have made it a prominent attention for scholars these days. The dispersed structure of cloud and its whole dependence on the internet for service delivery extant security problems. Methods: Hypervisor attack detection is carried out in this study using Modified Advanced Encryption Standard (MAES) system which ensures security prominently. It finds and detects the attacks earlier for secured VM migration. The proposed system includes main phases including system framework, load balancing, resource allocation and hypervisor attack detection via MAES algorithm. Initially, Over the duration of cloud computing, consider the quantity of tasks, VM, and cloud users. In this research, the MMH system is employed for load balancing to balance the total burden across the cloud. Tasks are moved from overloaded to underloaded nodes to attain load balancing. Next, the allocation of resources is carried out utilizing Adaptive Firefly (AF) optimization system which is used to select best resources optimally. It generates the best fitness values to choose the best resources. Results: It is also focused to improve the cost metric, computational complexity, throughput and VM performance in cloud. Then, to detect hypervisor attacks, the MAES method is employed. It specializes on offering enhanced security for cloud data and is employed to identify hypervisor and VM attackers. Conclusion: The findings produced the conclusion that the suggested MAES method superior to the current approaches according to throughput, computation cost, Mean Square Error (MSE) rate, and energy use.

Load Balancing using Genetic Algorithm with Cloud SIM Simulator in Open Source

Clouds are highly configurable infrastructure that offer software and platforms as a service, enabling users to subscribe for the services they need using a pay-as-you-go model. The popularity of cloud computing is growing due to its straightforward, service-oriented architecture. Every day, more and more people are using the cloud. Cloud computing is typically built on data centres with the capacity to support huge numbers of users. The ability of clouds to manage loads determines how reliable they are in order to address this issue; clouds need to include a load balancing system. In cloud computing, load balancing will help clouds become more capable and reliable by boosting their capacity.

Load Balancing in Cloud Computing Using Meta Heuristic Algorithm

Cloud computing involves load balancing, a technique for evenly distributing work across a cloud-based environment. Enterprises authorized applications to be managed, with these apps typically developed by the network's provider. The cloud system relies on multiple computers, supporting stakeholders in utilizing it for load balancing. It ensures virtual machines remain balanced, effectively distributing the workload among them and helping companies handle network traffic and workload issues. The load balancing system reduces imbalances among virtual machines, using the Bat algorithm to encrypt essential load balancing features. Our paper presents these techniques as a meta-heuristic algorithm. Keywords— Cloud Computing, Load Balancing, Virtual Machines, Workload.

GENESIS CGDYN: large-scale coarse-grained MD simulation with dynamic load balancing for heterogeneous biomolecular systems.

Residue-level coarse-grained (CG) molecular dynamics (MD) simulation is widely used to investigate slow biological processes that involve multiple proteins, nucleic acids, and their complexes. Biomolecules in a large simulation system are distributed non-uniformly, limiting computational efficiency with conventional methods. Here, we develop a hierarchical domain decomposition scheme with dynamic load balancing for heterogeneous biomolecular systems to keep computational efficiency even after drastic changes in particle distribution. These schemes are applied to the dynamics of intrinsically disordered protein (IDP) droplets. During the fusion of two droplets, we find that the changes in droplet shape correlate with the mixing of IDP chains. Additionally, we simulate large systems with multiple IDP droplets, achieving simulation sizes comparable to those observed in microscopy. In our MD simulations, we directly observe Ostwald ripening, a phenomenon where small droplets dissolve and their molecules redeposit into larger droplets. These methods have been implemented in CGDYN of the GENESIS software, offering a tool for investigating mesoscopic biological processes using the residue-level CG models.

A cloud-edge collaborative task scheduling method based on model segmentation

With the continuous development and combined application of cloud computing and artificial intelligence, some new methods have emerged to reduce task execution time for training neural network models in a cloud-edge collaborative environment. The most attractive method is neural network model segmentation. However, many factors affect the segmentation point, such as resource allocation, system energy consumption, load balancing, and network Bandwidth allocation. Some segmentation methods consider the shortest task execution time, which ignores the utilization of resources at the edge and can result in resource waste. Additionally, these factors are difficult to measure, which presents a challenge in calculating the best segmentation point to achieve the goal of maximum resource utilization and minimum task execution time. To solve this problem, this paper proposes a cloud-edge collaborative task scheduling method based on model segmentation (CECMS). This method first analyzes the factors affecting the segmentation point of the model and then obtains accurate factors that affect the segmentation point calculation through the pre-execution method. Furthermore, a multi-objective solution algorithm is improved to calculate the optimal model segmentation point. And tasks are separately offloaded to the edge and cloud based on the optimal model segmentation point. Finally, the experiments are conducted to verify the effectiveness of this method. Finally, the effectiveness of the CECMS method was verified through simulation experiments. Compared with the Dynamic Adaptive DNN Surgery (DADS) method and an adaptive DNN inference acceleration framework algorithm with end–edge–cloud collaborative computing algorithm (ADC), CECMS achieves the same effectiveness as DADS and ADC in optimizing task execution time by comprehensively considering the utilization of edge resources and minimizing task execution time, while also effectively ensuring resource utilization.

Алгоритм динамического распределения и балансировки нагрузки в распределенных облачных вычислениях

A mathematical model and algorithm of a two-level load management system for virtual clusters of a data processing center (data center) have been developed. At the first management level, virtual machines (VMs) are assigned to physical servers. At the same time, a greedy algorithm is used with restrictions on the time of searching for acceptable load distribution alternatives. The second level of management is implemented taking into account the chaotic structure of network traffic between the data center and users. Checking for the randomness of a time series of information traffic is carried out using Lyapunov exponents. The predictive model of the load intensity is implemented using the method of phase space reconstruction based on a set of values of a one-dimensional time series. When constructing a reconstructed phase space attractor, the time delay value is selected from the condition of reaching the zero value of the autocorrelation function, and the dimension of the embedding is determined by the angle of inclination of the straight line approximating the dependence of the value of the correlation integral on the radius of a given threshold point. The Tayler window is used to exclude correlated points in the numerical series. The criterion for evaluating the effectiveness of the developed algorithm is an integral indicator of the deviation of the load of each server from a given level. The proposed model can be used to build a data center load balancing system in conditions of its nonlinear nature.

Optimal Rate-Matrix Pruning For Heterogeneous Systems

We consider large-scale load balancing systems where processing time distribution of tasks depend on both task and server types. We analyze the system in the asymptotic regime where the number of task and server types tend to infinity proportionally to each other. In such heterogeneous setting, popular policies like Join Fastest Idle Queue (JFIQ), Join Fastest Shortest Queue (JFSQ) are known to perform poorly and they even shrink the stability region. Moreover, to the best of our knowledge, in this setup, finding a scalable policy with provable performance guarantee has been an open question prior to this work. In this paper, we propose and analyze two asymptotically delay-optimal dynamic load balancing approaches: (a) one that efficiently reserves the processing capacity of each server for "good" tasks and route tasks under the Join Idle Queue policy; and (b) a speed-priority policy that increases the probability of servers processing tasks at a high speed. Introducing a novel analytical framework and using the mean-field method and stochastic coupling arguments, we prove that both policies above achieve asymptotic zero queueing, whereby the probability that a typical task is assigned to an idle server tends to 1 as the system scales.

An optimized energy management and load balancing system based on cluster head selection for the vehicular network communication

An optimized energy management and load balancing system based on cluster head selection for the vehicular network communication

A balanced and reliable data replica placement scheme based on reinforcement learning in edge–cloud environments

With the rapid development of edge–cloud computing, distributing resources to edge nodes and terminal devices to provide high-quality services for latency-sensitive applications and reduce network communication costs has become increasingly important. However, the complexity and heterogeneity of the edge–cloud environment pose significant challenges to the reliability of data storage and device load balancing. To address these issues, in this paper, we propose a Deep Reinforcement Learning (DRL)-based data replica placement scheme, BRPS. This scheme considers the different geographic locations of hardware devices, the heterogeneous storage capacity and reliability, and the different data requirements of varying user services in edge–cloud environments. Firstly, we constructed a model for data replica placement in the edge–cloud environment, addressing key factors such as latency, reliability, and load, focusing on the heterogeneity of device resources and reliability, and the diverse data needs of user services. Furthermore, we propose the BRPS scheme using the Double Deep Q-Network (DDQN) method of DRL, transforming the data replica placement issue into a multi-objective optimization problem. By placing the DRL-based decision process in a separate management edge node, the separation of decision and execution is achieved, which enhances the efficiency of data replica placement, ensures data reliability, reduces latency, and achieves system load balance. Experimental results demonstrate that BRPS significantly outperforms the existing comparison schemes while ensuring data reliability. The BRPS scheme reduces latency by 8.12% compared to the Random scheme and outperforms the best heuristic in system load balancing and memory utilization by 13.15% and 11.91%, respectively. Moreover, BRPS shows superior adaptability in extreme network congestion scenarios and effectively adapts to the dynamic changes of nodes in edge–cloud environments.

A New WRR Algorithm for an Efficient Load Balancing System in IoT Networks under SDN

The Internet of Things (IoT) connects various smart objects and manages a vast network using diverse technologies, which present numerous challenges. Software-defined networking (SDN) is a system that addresses the challenges of traditional networks and ensures the centralized configuration of network entities to manage network integrity. Furthermore, the uneven distribution of IoT network load results in the depletion of IoT device resources. To address this issue, traffic must be distributed equally, requiring efficient load balancing to be ensured. This requires the development of an efficient architecture for IoT networks. The main goal of this paper is to propose a novel architecture that leverages the potential of SDN, the clustering technique, and a new weighted round-robin (N-WRR) protocol. The objective of this architecture is to achieve load balancing, which is a crucial aspect in the development of IoT networks as it ensures the network’s efficiency. Furthermore, to prevent network congestion and ensure efficient data flow by redistributing traffic from overloaded paths to less burdened ones. The simulation results demonstrate that our N-WRR algorithm achieves highly efficient load balancing compared to the simple weighted round-robin (WRR), and without the application of any load balancing method. Furthermore, our proposed approach enhances throughput, data transfer, and bandwidth availability. This results in an increase in processed requests.

Exact mixed-integer quadratic formulation and solution for large-scale thermal unit commitment

Abstract Thermal unit commitment (UC) is a nonlinear combinatorial optimization problem that minimizes total operating costs while considering system load balance, on/off restrictions and other constraints. Successfully solving the thermal UC problem contributes to a more reliable power system and reduces thermal costs. This paper presents an exact mixed-integer quadratic programming (EMIQP) method for large-scale thermal UC problems. EMIQP revolutionizes the landscape by seamlessly translating the intricate nonlinear combinatorial optimization problem of UC into an exact mixed-integer quadratic formulation. This approach also elegantly reimagines on/off constraints as mixed-integer linear equations, employing both the sum and respective approaches. Our case studies unequivocally demonstrate the exceptional prowess of the EMIQP method, consistently securing the global optimum. Moreover, the mathematical-based EMIQP method produces identical results at each run, which is extremely important for UC in the real world.