Distributed Graph Database Load Balancing Method Based on Deep Reinforcement Learning

This paper focuses on the scheduling problem of workflow tasks that exhibit interdependencies.Unlike indepen-dent batch tasks,workflows typically consist of multiple subtasks with intrinsic correlations and dependencies.It necessitates the distribution of various computational tasks to appropriate computing node resources in accor-dance with task dependencies to ensure the smooth completion of the entire workflow.Workflow scheduling must consider an array of factors,including task dependencies,availability of computational resources,and the schedulability of tasks.Therefore,this paper delves into the distributed graph database workflow task scheduling problem and proposes a workflow scheduling methodology based on deep reinforcement learning(DRL).The method optimizes the maximum completion time(makespan)and response time of workflow tasks,aiming to enhance the responsiveness of workflow tasks while ensuring the minimization of the makespan.The experimental results indicate that the Q-learning Deep Reinforcement Learning(Q-DRL)algorithm markedly diminishes the makespan and refines the average response time within distributed graph database environments.In quantifying makespan,Q-DRL achieves mean reductions of 12.4%and 11.9%over established First-fit and Random scheduling strategies,respectively.Additionally,Q-DRL surpasses the performance of both DRL-Cloud and Improved Deep Q-learning Network(IDQN)algorithms,with improvements standing at 4.4%and 2.6%,respectively.With reference to average response time,the Q-DRL approach exhibits a significantly enhanced performance in the scheduling of workflow tasks,decreasing the average by 2.27%and 4.71%when compared to IDQN and DRL-Cloud,respectively.The Q-DRL algorithm also demonstrates a notable increase in the efficiency of system resource utilization,reducing the average idle rate by 5.02%and 9.30%in comparison to IDQN and DRL-Cloud,respectively.These findings support the assertion that Q-DRL not only upholds a lower average idle rate but also effectively curtails the average response time,thereby substantially improving processing efficiency and optimizing resource utilization within distributed graph database systems.

Joint position optimization,user association,and resource allocation for load balancing in UAV-assisted wireless networks

Unbalanced traffic distribution in cellular networks results in congestion and degrades spectrum efficiency.To tackle this problem,we propose an Unmanned Aerial Vehicle(UAV)-assisted wireless network in which the UAV acts as an aerial relay to divert some traffic from the overloaded cell to its adjacent underloaded cell.To fully exploit its potential,we jointly optimize the UAV position,user association,spectrum allocation,and power allocation to maximize the sum-log-rate of all users in two adjacent cells.To tackle the complicated joint optimization problem,we first design a genetic-based algorithm to optimize the UAV position.Then,we simplify the problem by theoretical analysis and devise a low-complexity algorithm according to the branch-and-bound method,so as to obtain the optimal user association and spectrum allocation schemes.We further propose an iterative power allocation algorithm based on the sequential convex approximation theory.The simulation results indicate that the proposed UAV-assisted wireless network is superior to the terrestrial network in both utility and throughput,and the proposed algorithms can substantially improve the network performance in comparison with the other schemes.

Systematic Review:Load Balancing in Cloud Computing by Using Metaheuristic Based Dynamic Algorithms

Cloud Computing has the ability to provide on-demand access to a shared resource pool.It has completely changed the way businesses are managed,implement applications,and provide services.The rise in popularity has led to a significant increase in the user demand for services.However,in cloud environments efficient load balancing is essential to ensure optimal performance and resource utilization.This systematic review targets a detailed description of load balancing techniques including static and dynamic load balancing algorithms.Specifically,metaheuristic-based dynamic load balancing algorithms are identified as the optimal solution in case of increased traffic.In a cloud-based context,this paper describes load balancing measurements,including the benefits and drawbacks associated with the selected load balancing techniques.It also summarizes the algorithms based on implementation,time complexity,adaptability,associated issue(s),and targeted QoS parameters.Additionally,the analysis evaluates the tools and instruments utilized in each investigated study.Moreover,comparative analysis among static,traditional dynamic and metaheuristic algorithms based on response time by using the CloudSim simulation tool is also performed.Finally,the key open problems and potential directions for the state-of-the-art metaheuristic-based approaches are also addressed.

Review of Load Balancing Mechanisms in SDN-Based Data Centers

With the continuous expansion of the data center network scale, changing network requirements, and increasing pressure on network bandwidth, the traditional network architecture can no longer meet people’s needs. The development of software defined networks has brought new opportunities and challenges to future networks. The data and control separation characteristics of SDN improve the performance of the entire network. Researchers have integrated SDN architecture into data centers to improve network resource utilization and performance. This paper first introduces the basic concepts of SDN and data center networks. Then it discusses SDN-based load balancing mechanisms for data centers from different perspectives. Finally, it summarizes and looks forward to the study on SDN-based load balancing mechanisms and its development trend.

Coordinated Capacitor Voltage Balancing Method for Cascaded H-bridge Inverter with Supercapacitor and DC-DC Stage

Cascaded H-bridge inverter(CHBI) with supercapacitors(SCs) and dc-dc stage shows significant promise for medium to high voltage energy storage applications. This paper investigates the voltage balance of capacitors within the CHBI, including both the dc-link capacitors and SCs. Balance control over the dc-link capacitor voltages is realized by the dcdc stage in each submodule(SM), while a hybrid modulation strategy(HMS) is implemented in the H-bridge to balance the SC voltages among the SMs. Meanwhile, the dc-link voltage fluctuations are analyzed under the HMS. A virtual voltage variable is introduced to coordinate the balancing of dc-link capacitor voltages and SC voltages. Compared to the balancing method that solely considers the SC voltages, the presented method reduces the dc-link voltage fluctuations without affecting the voltage balance of SCs. Finally, both simulation and experimental results verify the effectiveness of the presented method.

RcbHLH59-RcPRs module enhances salinity stress tolerance by balancing Na^(+)/K^(+) through callose deposition in rose (Rosa chinensis)

Basic helix–loop–helix(bHLH)proteins play pivotal roles in plant growth,development,and stress responses.However,the molecular and functional properties of bHLHs have not been fully characterized.In this study,a novel XI subgroup of the bHLH protein gene RcbHLH59 was isolated and identified in rose(Rosa sp.).This gene was induced by salinity stress in both rose leaves and roots,and functioned as a transactivator.Accordingly,silencing RcbHLH59 affected the antioxidant system,^(Na+/K+)balance,and photosynthetic system,thereby reducing salt tolerance,while the transient overexpression of RcbHLH59 improved salinity stress tolerance.Additionally,RcbLHLH59 was found to regulate the expression of sets of pathogenesis-related(PR)genes in RcbHLH59-silenced(TRV-RcbHLH59)and RcbHLH59-overexpressing(RcbHLH59-OE)rose plants.The RcPR4/1 and RcPR5/1 transcript levels showed opposite changes in the TRVRcbHLH59 and RcbHLH59-OE lines,suggesting that these two genes are regulated by RcbHLH59.Further analysis revealed that RcbHLH59 binds to the promoters of RcPR4/1 and RcPR5/1,and that the silencing of RcPR4/1 or RcPR5/1 led to decreased tolerance to salinity stress.Moreover,callose degradation-and deposition-related genes were impaired in RcPR4/1-or RcPR5/1-silenced plants,which displayed a salt tolerance phenotype by balancing the ^(Na+/K+)ratio through callose deposition.Collectively,our data highlight a new RcbLHLH59-RcPRs module that positively regulates salinity stress tolerance by balancing Na^(+)/K^(+)and through callose deposition in rose plants.

Balancing sub‐reaction activity to boost electrocatalytic urea synthesis using a metal‐free electrocatalyst

Electrocatalytic urea synthesis via coupling of nitrate with CO_(2)is considered as a promising alternative to the industrial urea synthetic process.However,the requirement of sub-reaction(NO_(3)RR and CO_(2)RR)activities for efficient urea synthesis is not clear and the related reaction mechanisms remain obscure.Here,the construction,breaking,and rebuilding of the sub-reaction activity balance would be accompanied by the corresponding regulation in urea synthesis,and the balance of sub-reaction activities was proven to play a vital role in efficient urea synthesis.With rational design,a urea yield rate of 610.6 mg h−1 gcat.−1 was realized on the N-doped carbon electrocatalyst,superior to that of noble-metal electrocatalysts.Based on the operando SRFTIR measurements,we proposed that urea synthesis arises from the coupling of^(*)NO and^(*)CO to generate the key intermediate of^(*)OCNO.This work provides new insights and guidelines into urea synthesis from the aspect of activity balance.

An Integrated Load Balancing Scheme Based on SDN ASR Algorithm

At present,the flow table of the SDN switch is stored in the costly Ternary Content Addressable Memory(TCAM)cache.Due to the cost problem,the number of flow tables that the SDN switch can store is extremely limited,which is far less than the number of traffic,so it is prone to overflow problem,and leads to network paralysis.That has become a bottleneck in restricting the processing capacity of the data center,and will become a weak point focused by attackers.In this paper,we propose an algorithm for the Alarm Switch Remove(ASR)that fully loads the flow table space in SDN,and further put forward an integrated load balancing scheme in SDN.Finally,we use Mininet to verify that the scheme can ease the SDN switch flow table overflow problem and increase network throughput.

Classification of Request-Based Mobility Load Balancing in Fog Computing

Every day,more and more data is being produced by the Internet of Things(IoT)applications.IoT data differ in amount,diversity,veracity,and velocity.Because of latency,various types of data handling in cloud computing are not suitable for many time-sensitive applications.When users move from one site to another,mobility also adds to the latency.By placing computing close to IoT devices with mobility support,fog computing addresses these problems.An efficient Load Balancing Algorithm(LBA)improves user experience and Quality of Service(QoS).Classification of Request(CoR)based Resource Adaptive LBA is suggested in this research.This technique clusters fog nodes using an efficient K-means clustering algorithm and then uses a Decision Tree approach to categorize the request.The decision-making process for time-sensitive and delay-tolerable requests is facilitated by the classification of requests.LBA does the operation based on these classifications.The MobFogSim simulation program is utilized to assess how well the algorithm with mobility features performs.The outcome demonstrates that the LBA algorithm’s performance enhances the total system performance,which was attained by(90.8%).Using LBA,several metrics may be examined,including Response Time(RT),delay(d),Energy Consumption(EC),and latency.Through the on-demand provisioning of necessary resources to IoT users,our suggested LBA assures effective resource usage.

Load Balancing Based on Multi-Agent Framework to Enhance Cloud Environment

According to the advances in users’service requirements,physical hardware accessibility,and speed of resource delivery,Cloud Computing(CC)is an essential technology to be used in many fields.Moreover,the Internet of Things(IoT)is employed for more communication flexibility and richness that are required to obtain fruitful services.A multi-agent system might be a proper solution to control the load balancing of interaction and communication among agents.This paper proposes a multi-agent load balancing framework that consists of two phases to optimize the workload among different servers with large-scale CC power with various utilities and a significant number of IoT devices with low resources.Different agents are integrated based on relevant features of behavioral interaction using classification techniques to balance the workload.Aload balancing algorithm is developed to serve users’requests to improve the solution of workload problems with an efficient distribution.The activity task from IoT devices has been classified by feature selection methods in the preparatory phase to optimize the scalability ofCC.Then,the server’s availability is checked and the classified task is assigned to its suitable server in the main phase to enhance the cloud environment performance.Multi-agent load balancing framework is succeeded to cope with the importance of using large-scale requirements of CC and(low resources and large number)of IoT.

Efficient Cloud Resource Scheduling with an Optimized Throttled Load Balancing Approach

Cloud Technology is a new platform that offers on-demand computing Peripheral such as storage,processing power,and other computer system resources.It is also referred to as a system that will let the consumers utilize computational resources like databases,servers,storage,and intelligence over the Internet.In a cloud network,load balancing is the process of dividing network traffic among a cluster of available servers to increase efficiency.It is also known as a server pool or server farm.When a single node is overwhelmed,balancing the workload is needed to manage unpredictable workflows.The load balancer sends the load to another free node in this case.We focus on the Balancing of workflows with the proposed approach,and we present a novel method to balance the load that manages the dynamic scheduling process.One of the preexisting load balancing techniques is considered,however it is somewhat modified to fit the scenario at hand.Depending on the experimentation’s findings,it is concluded that this suggested approach improves load balancing consistency,response time,and throughput by 6%.

Latency Minimization Using an Adaptive Load Balancing Technique in Microservices Applications

Advancements in cloud computing and virtualization technologies have revolutionized Enterprise Application Development with innovative ways to design and develop complex systems.Microservices Architecture is one of the recent techniques in which Enterprise Systems can be developed as fine-grained smaller components and deployed independently.This methodology brings numerous benefits like scalability,resilience,flexibility in development,faster time to market,etc.and the advantages;Microservices bring some challenges too.Multiple microservices need to be invoked one by one as a chain.In most applications,more than one chain of microservices runs in parallel to complete a particular requirement To complete a user’s request.It results in competition for resources and the need for more inter-service communication among the services,which increases the overall latency of the application.A new approach has been proposed in this paper to handle a complex chain of microservices and reduce the latency of user requests.A machine learning technique is followed to predict the weighting time of different types of requests.The communication time among services distributed among different physical machines are estimated based on that and obtained insights are applied to an algorithm to calculate their priorities dynamically and select suitable service instances to minimize the latency based on the shortest queue waiting time.Experiments were done for both interactive as well as non interactive workloads to test the effectiveness of the solution.The approach has been proved to be very effective in reducing latency in the case of long service chains.

A novel proactive soft load balancing framework for ultra dense network

A major challenge for the future wireless network is to design the self-organizing architecture.The reactive self-organizing model of traditional networks needs to be transformed into an active self-organizing network.Due to the user mobility and the coverage of small cells,the network load often becomes unbalanced,resulting in poor network performance.Mobility management has become an important issue to ensure seamless communication when users move between cells,and proactive mobility management is one of the important functions of the active Self-Organizing Network(SON).This paper proposes a proactive mobility management framework for active SON,which transforms the original reactive load balancing into a forward-aware and proactive load balancing.The proposed framework firstly uses the BART model to predict the users’temporal and spatial mobility based on a weekly cycle and then formulate the MLB optimization problem based on the soft load.Two solutions are proposed to solve the above MLB problem.The simulation results show that the proposed method can better optimize the network performance and realize intelligent mobile management for the future network.

Hybrid Mobile Cloud Computing Architecture with Load Balancing for Healthcare Systems

Healthcare is a fundamental part of every individual’s life.The healthcare industry is developing very rapidly with the help of advanced technologies.Many researchers are trying to build cloud-based healthcare applications that can be accessed by healthcare professionals from their premises,as well as by patients from their mobile devices through communication interfaces.These systems promote reliable and remote interactions between patients and healthcare professionals.However,there are several limitations to these innovative cloud computing-based systems,namely network availability,latency,battery life and resource availability.We propose a hybrid mobile cloud computing(HMCC)architecture to address these challenges.Furthermore,we also evaluate the performance of heuristic and dynamic machine learning based task scheduling and load balancing algorithms on our proposed architecture.We compare them,to identify the strengths and weaknesses of each algorithm;and provide their comparative results,to show latency and energy consumption performance.Challenging issues for cloudbased healthcare systems are discussed in detail.

Fuzzy Firefly Based Intelligent Algorithm for Load Balancing inMobile Cloud Computing

This paper presents a novel fuzzy firefly-based intelligent algorithm for load balancing in mobile cloud computing while reducing makespan.The proposed technique implicitly acts intelligently by using inherent traits of fuzzy and firefly.It automatically adjusts its behavior or converges depending on the information gathered during the search process and objective function.It works for 3-tier architecture,including cloudlet and public cloud.As cloudlets have limited resources,fuzzy logic is used for cloudlet selection using capacity and waiting time as input.Fuzzy provides human-like decisions without using any mathematical model.Firefly is a powerful meta-heuristic optimization technique to balance diversification and solution speed.It balances the load on cloud and cloudlet while minimizing makespan and execution time.However,it may trap in local optimum;levy flight can handle it.Hybridization of fuzzy fireflywith levy flight is a novel technique that provides reduced makespan,execution time,and Degree of imbalance while balancing the load.Simulation has been carried out on the Cloud Analyst platform with National Aeronautics and Space Administration(NASA)and Clarknet datasets.Results show that the proposed algorithm outperforms Ant Colony Optimization Queue Decision Maker(ACOQDM),Distributed Scheduling Optimization Algorithm(DSOA),andUtility-based Firefly Algorithm(UFA)when compared in terms of makespan,Degree of imbalance,and Figure of Merit.

Learning-Based Joint Service Caching and Load Balancing for MEC Blockchain Networks

Integrating the blockchain technology into mobile-edge computing(MEC)networks with multiple cooperative MEC servers(MECS)providing a promising solution to improving resource utilization,and helping establish a secure reward mechanism that can facilitate load balancing among MECS.In addition,intelligent management of service caching and load balancing can improve the network utility in MEC blockchain networks with multiple types of workloads.In this paper,we investigate a learningbased joint service caching and load balancing policy for optimizing the communication and computation resources allocation,so as to improve the resource utilization of MEC blockchain networks.We formulate the problem as a challenging long-term network revenue maximization Markov decision process(MDP)problem.To address the highly dynamic and high dimension of system states,we design a joint service caching and load balancing algorithm based on the double-dueling Deep Q network(DQN)approach.The simulation results validate the feasibility and superior performance of our proposed algorithm over several baseline schemes.

Review of All Possible Conversion Equations of Influence Coefficients with Different Formats on Two-Plane Balancing

This article lists all possible conversion equations of influence coefficients(ICs)with different formats when some of these are known to handle two-plane balancing tasks with no or less trial weight runs.There are two approaches for two-plane balancing.One can treat it as a multi-plane balance problem involving a 2×2 matrix of complex ICs where two direct ICs along with two cross-effect ICs are generated so that correction weights at one or two balance planes can be determined.One can also apply a static pare(in-phase)and/or couple pair(180 degrees out-of-phase)weights for balancing.The latter approach has been used quite often in the field,especially on steam turbine and generator rotors.Dependent on vibration mode shapes and combinations as well as balance plane accessibility,sometimes applying static or couple pair weights can be a wise choice;other times weights at one or two end planes are needed.There are totally 4 possible sets of IC data due to weights at plane 1,plane 2,static pair,and couple pair.IC data would typically be obtained by applying trial weights followed by trial weight runs.It is found,however,that all these IC data can be converted easily without trial weight runs once any two of 4 sets are known.The above findings and conversion equations have been obtained analytically and verified by experimental results.Real cases are given to demonstratetheirapplications.

Optimization of shut-in time based on saturation rebalancing in volume-fractured tight oil reservoirs

Based on imbibition replacement of shut-in well in tight oil reservoirs, this paper expounds the principle of saturation rebalancing during the shut-in process after fracturing, establishes an optimization method for shut-in time after horizontal well volume fracturing with the goal of shortening oil breakthrough time and achieving rapid oil breakthrough, and analyzes the influences of permeability, porosity, fracture half-length and fracturing fluid volume on the shut-in time. The oil and water imbibition displacement in the matrix and fractures occurs during the shut-in process of wells after fracturing. If the shut-in time is too short, the oil-water displacement is not sufficient, and the oil breakthrough time is long after the well is put into production. If the shut-in time is too long, the oil and water displacement is sufficient, but the energy dissipation in the formation near the bottom of the well is severe, and the flowing period is short and the production is low after the well is put into production. A rational shut-in time can help shorten the oil breakthrough time, extend the flowing period and increase the production of the well. The rational shut-in time is influenced by factors such as permeability, porosity, fracture half-length and fracturing fluid volume. The shortest and longest shut-in times are negatively correlated with porosity, permeability, and fracture half-length, and positively correlated with fracturing fluid volume. The pilot test in tight oil horizontal wells in the Songliao Basin, NE China, has confirmed that the proposed optimization method can effectively improve the development effect of horizontal well volume fracturing.

Energy Efficient Load Balancing and Routing Using Multi-Objective Based Algorithm in WSN

In wireless sensor network(WSN),the gateways which are placed far away from the base station(BS)forward the collected data to the BS through the gateways which are nearer to the BS.This leads to more energy consumption because the gateways nearer to the BS manages heavy traffic load.So,to over-come this issue,loads around the gateways are to be balanced by presenting energy efficient clustering approach.Besides,to enhance the lifetime of the net-work,optimal routing path is to be established between the source node and BS.For energy efficient load balancing and routing,multi objective based beetle swarm optimization(BSO)algorithm is presented in this paper.Using this algo-rithm,optimal clustering and routing are performed depend on the objective func-tions routingfitness and clusteringfitness.This approach leads to decrease the power consumption.Simulation results show that the performance of the pro-posed BSO based clustering and routing scheme attains better results than that of the existing algorithms in terms of energy consumption,delivery ratio,through-put and network lifetime.Namely,the proposed scheme increases throughput to 72%and network lifetime to 37%as well as it reduces delay to 37%than the existing optimization algorithms based clustering and routing schemes.

Fuzzy Fruit Fly Optimized Node Quality-Based Clustering Algorithm for Network Load Balancing

Recently,the fundamental problem with Hybrid Mobile Ad-hoc Net-works(H-MANETs)is tofind a suitable and secure way of balancing the load through Internet gateways.Moreover,the selection of the gateway and overload of the network results in packet loss and Delay(DL).For optimal performance,it is important to load balance between different gateways.As a result,a stable load balancing procedure is implemented,which selects gateways based on Fuzzy Logic(FL)and increases the efficiency of the network.In this case,since gate-ways are selected based on the number of nodes,the Energy Consumption(EC)was high.This paper presents a novel Node Quality-based Clustering Algo-rithm(NQCA)based on Fuzzy-Genetic for Cluster Head and Gateway Selection(FGCHGS).This algorithm combines NQCA with the Improved Weighted Clus-tering Algorithm(IWCA).The NQCA algorithm divides the network into clusters based upon node priority,transmission range,and neighbourfidelity.In addition,the simulation results tend to evaluate the performance effectiveness of the FFFCHGS algorithm in terms of EC,packet loss rate(PLR),etc.