On the use of the genetic programming for balanced load distribution in software-defined networks

As a new networking paradigm,Software-Defined Networking(SDN)enables us to cope with the limitations of traditional networks.SDN uses a controller that has a global view of the network and switch devices which act as packet forwarding hardware,known as“OpenFlow switches”.Since load balancing service is essential to distribute workload across servers in data centers,we propose an effective load balancing scheme in SDN,using a genetic programming approach,called Genetic Programming based Load Balancing(GPLB).We formulate the problem to find a path:1)with the best bottleneck switch which has the lowest capacity within bottleneck switches of each path,2)with the shortest path,and 3)requiring the less possible operations.For the purpose of choosing the real-time least loaded path,GPLB immediately calculates the integrated load of paths based on the information that receives from the SDN controller.Hence,in this design,the controller sends the load information of each path to the load balancing algorithm periodically and then the load balancing algorithm returns a least loaded path to the controller.In this paper,we use the Mininet emulator and the OpenDaylight controller to evaluate the effectiveness of the GPLB.The simulative study of the GPLB shows that there is a big improvement in performance metrics and the latency and the jitter are minimized.The GPLB also has the maximum throughput in comparison with related works and has performed better in the heavy traffic situation.The results show that our model stands smartly while not increasing further overhead.

Optimal Design of Deforming Regulation for Compact Continuous Rolling Mill with Balanced Load

If the draught of each mill stand is limited by forced bite condition for compact continuous mill,the rolling load difference between one mill stand and another is very big.If deforming regulation of relative load for each mill stand is approximate to the same,the productive capacity of compact continuous mill can be brought into full play,and also the safety running and the smooth rolling of mill can be ensured.

Blockchain Based Secured Load Balanced Task Scheduling Approach for Fitness Service

In recent times,the evolution of blockchain technology has got huge attention from the research community due to its versatile applications and unique security features.The IoT has shown wide adoption in various applications including smart cities,healthcare,trade,business,etc.Among these applications,fitness applications have been widely considered for smart fitness systems.The users of the fitness system are increasing at a high rate thus the gym providers are constantly extending the fitness facilities.Thus,scheduling such a huge number of requests for fitness exercise is a big challenge.Secondly,the user fitness data is critical thus securing the user fitness data from unauthorized access is also challenging.To overcome these issues,this work proposed a blockchain-based load-balanced task scheduling approach.A thorough analysis has been performed to investigate the applications of IoT in the fitness industry and various scheduling approaches.The proposed scheduling approach aims to schedule the requests of the fitness users in a load-balanced way that maximize the acceptance rate of the users’requests and improve resource utilization.The performance of the proposed task scheduling approach is compared with the state-of-the-art approaches concerning the average resource utilization and task rejection ratio.The obtained results confirm the efficiency of the proposed scheduling approach.For investigating the performance of the blockchain,various experiments are performed using the Hyperledger Caliper concerning latency,throughput,resource utilization.The Solo approach has shown an improvement of 32%and 26%in throughput as compared to Raft and Solo-Raft approaches respectively.The obtained results assert that the proposed architecture is applicable for resource-constrained IoT applications and is extensible for different IoT applications.

Improved Load-Balanced Clustering for Energy-Aware Routing(ILBC-EAR)in WSNs

Sensors are considered as important elements of electronic devices.In many applications and service,Wireless Sensor Networks(WSNs)are involved in significant data sharing that are delivered to the sink node in energy efficient man-ner using multi-hop communications.But,the major challenge in WSN is the nodes are having limited battery resources,it is important to monitor the consumption rate of energy is very much needed.However,reducing energy con-sumption can increase the network lifetime in effective manner.For that,clustering methods are widely used for optimizing the rate of energy consumption among the sensor nodes.In that concern,this paper involves in deriving a novel model called Improved Load-Balanced Clustering for Energy-Aware Routing(ILBC-EAR),which mainly concentrates on optimal energy utilization with load-balanced process among cluster heads and member nodes.For providing equal rate of energy consumption among nodes,the dimensions of framed clusters are measured.Moreover,the model develops a Finest Routing Scheme based on Load-Balanced Clustering to transmit the sensed information to the sink or base station.The evaluation results depict that the derived energy aware model attains higher rate of life time than other works and also achieves balanced energy rate among head node.Additionally,the model also provides higher throughput and minimal delay in delivering data packets.

BE-RPL:Balanced-load and Energy-efficient RPL

Internet of Things(IoT)empowers imaginative applications and permits new services when mobile nodes are included.For IoT-enabled low-power and lossy networks(LLN),the Routing Protocol for Low-power and Lossy Networks(RPL)has become an established standard routing protocol.Mobility under standard RPL remains a difficult issue as it causes continuous path disturbance,energy loss,and increases the end-to-end delay in the network.In this unique circumstance,a Balanced-load and Energy-efficient RPL(BE-RPL)is proposed.It is a routing technique that is both energy-efficient and mobility-aware.It responds quicker to link breakage through received signal strength-based mobility monitoring and selecting a new preferred parent reactively.The proposed system also implements load balancing among stationary nodes for leaf node allocation.Static nodes with more leaf nodes are restricted from participating in the election for a new preferred parent.The performance of BE-RPL is assessed using the COOJA simulator.It improves the energy use,network control overhead,frame acknowledgment ratio,and packet delivery ratio of the network.

Wireless Network Security Using Load Balanced Mobile Sink Technique

Real-time applications based on Wireless Sensor Network(WSN)tech-nologies are quickly increasing due to intelligent surroundings.Among the most significant resources in the WSN are battery power and security.Clustering stra-tegies improve the power factor and secure the WSN environment.It takes more electricity to forward data in a WSN.Though numerous clustering methods have been developed to provide energy consumption,there is indeed a risk of unequal load balancing,resulting in a decrease in the network’s lifetime due to network inequalities and less security.These possibilities arise due to the cluster head’s limited life span.These cluster heads(CH)are in charge of all activities and con-trol intra-cluster and inter-cluster interactions.The proposed method uses Lifetime centric load balancing mechanisms(LCLBM)and Cluster-based energy optimiza-tion using a mobile sink algorithm(CEOMS).LCLBM emphasizes the selection of CH,system architectures,and optimal distribution of CH.In addition,the LCLBM was added with an assistant cluster head(ACH)for load balancing.Power consumption,communications latency,the frequency of failing nodes,high security,and one-way delay are essential variables to consider while evaluating LCLBM.CEOMS will choose a cluster leader based on the influence of the fol-lowing parameters on the energy balance of WSNs.According to simulatedfind-ings,the suggested LCLBM-CEOMS method increases cluster head selection self-adaptability,improves the network’s lifetime,decreases data latency,and bal-ances network capacity.

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.

A Sender-Initiated Fuzzy Logic Contrnol Method for Network Load Balancing

In this paper, a sender-initiated protocol is applied which uses fuzzy logic control method to improve computer networks performance by balancing loads among computers. This new model devises sender-initiated protocol for load transfer for load balancing. Groups are formed and every group has a node called a designated representative (DR). During load transferring processes, loads are transferred using the DR in each group to achieve load balancing purposes. The simulation results show that the performance of the protocol proposed is better than the compared conventional method. This protocol is more stable than the method without using the fuzzy logic control.

Dynamic load balancing based on restricted multicast tree in triplet-based hierarchical interconnection network

To solve the load balancing problem in a triplet-based hierarchical interconnection network（THIN） system, a dynamic load balancing （DLB）algorithm--THINDLBA, which adopts multicast tree （MT）technology to improve the efficiency of interchanging load information, is presented. To support the algorithm, a complete set of DLB messages and a schema of maintaining DLB information in each processing node are designed. The load migration request messages from the heavily loaded node （HLN）are spread along an MT whose root is the HLN. And the lightly loaded nodes（LLNs） covered by the MT are the candidate destinations of load migration; the load information interchanged between the LLNs and the HLN can be transmitted along the MT. So the HLN can migrate excess loads out as many as possible during a one time execution of the THINDLBA, and its load state can be improved as quickly as possible. To avoid wrongly transmitted or redundant DLB messages due to MT overlapping, the MT construction is restricted in the design of the THINDLBA. Through experiments, the effectiveness of four DLB algorithms are compared, and the results show that the THINDLBA can effectively decrease the time costs of THIN systems in dealing with large scale computeintensive tasks more than others.

Load-balancing data distribution in publish/subscribe mode

To improve data distribution efficiency a load-balancing data distribution LBDD method is proposed in publish/subscribe mode.In the LBDD method subscribers are involved in distribution tasks and data transfers while receiving data themselves.A dissemination tree is constructed among the subscribers based on MD5 where the publisher acts as the root. The proposed method provides bucket construction target selection and path updates furthermore the property of one-way dissemination is proven.That the average out-going degree of a node is 2 is guaranteed with the proposed LBDD.The experiments on data distribution delay data distribution rate and load distribution are conducted. Experimental results show that the LBDD method aids in shaping the task load between the publisher and subscribers and outperforms the point-to-point approach.

Load balancing framework for actively replicated servers

This paper focuses on solving a problem of improving system robustness and the efficiency of a distributed system at the same time. Fault tolerance with active replication and load balancing techniques are used. The pros and cons of both techniques are analyzed, and a novel load balancing framework for fault tolerant systems with active replication is presented. Hierarchical architecture is described in detail. The framework can dynamically adjust fault tolerant groups and their memberships with respect to system loads. Three potential task scheduler group selection methods are proposed and simulation tests are made. Further analysis of test data is done and helpful observations for system design are also pointed out, including effects of task arrival intensity and task set size, relationship between total task execution time and single task execution time.

Hybrid-Traffic-Detour Based Load Balancing for Onboard Routing in LEO Satellite Networks

To deal with the dynamic and imbalanced traffic requirements in Low Earth Orbit satellite networks, several distributed load balancing routing schemes have been proposed. However, because of the lack of global view, these schemes may lead to cascading congestion in regions with high volume of traffic. To solve this problem, a Hybrid-Traffic-Detour based Load Balancing Routing(HLBR) scheme is proposed, where a Long-Distance Traffic Detour(LTD) method is devised and coordinates with distributed traffic detour method to perform self-adaptive load balancing. The forwarding path of LTD is acquired by the Circuitous Multipath Calculation(CMC) based on prior geographical information, and activated by the LTDShift-Trigger(LST) through real-time congestion perception. Simulation results show that the HLBR can mitigate cascading congestion and achieve efficient traffic distribution.

A Novel Load Balancing Strategy of Software-Defined Cloud/Fog Networking in the Internet of Vehicles

The Internet of Vehicles(IoV)has been widely researched in recent years,and cloud computing has been one of the key technologies in the IoV.Although cloud computing provides high performance compute,storage and networking services,the IoV still suffers with high processing latency,less mobility support and location awareness.In this paper,we integrate fog computing and software defined networking(SDN) to address those problems.Fog computing extends computing and storing to the edge of the network,which could decrease latency remarkably in addition to enable mobility support and location awareness.Meanwhile,SDN provides flexible centralized control and global knowledge to the network.In order to apply the software defined cloud/fog networking(SDCFN) architecture in the IoV effectively,we propose a novel SDN-based modified constrained optimization particle swarm optimization(MPSO-CO) algorithm which uses the reverse of the flight of mutation particles and linear decrease inertia weight to enhance the performance of constrained optimization particle swarm optimization(PSO-CO).The simulation results indicate that the SDN-based MPSO-CO algorithm could effectively decrease the latency and improve the quality of service(QoS) in the SDCFN architecture.

Load Balancing-Based Routing Optimization Mechanism for Power Communication Networks

In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.

Optimal Load Balancing Leveling Method for Multi-leg Flexible Platforms

The working platforms supported with multiple extensible legs must be leveled before they come into operation.Although the supporting stiffness and reliability of the platform are improved with the increasing number of the supporting legs,the increased overdetermination of the multi-leg platform systems leads to leveling coupling problem among legs and virtual leg problem in which some of the supporting legs bear zero or quasi zero loads.These problems make it quite complex and time consuming to level such a multi-leg platform.Based on rigid body kinematics,an approximate equation is formulated to rapidly calculate the leg extension for leveling a rigid platform,then a proportional speed control strategy is proposed to reduce the unexpected platform distortion and leveling coupling between supporting legs.Taking both the load coupling between supporting legs and the elastic flexibility of the working platform into consideration,an optimal balancing legs’ loads(OBLL) model is firstly put forward to deal with the traditional virtual leg problem.By taking advantage of the concept of supporting stiffness matrix,a coupling extension method(CEM) is developed to solve this OBLL problem for multi-leg flexible platform.At the end,with the concept of supporting stiffness matrix and static transmissibility matrix,an optimal load balancing leveling method is proposed to achieve geometric leveling and legs’ loads balancing simultaneously.Three numerical examples are given out to illustrate the performance of proposed methods.This paper proposes a method which can effectively quantify all of the legs’ extension at the same time,achieve geometric leveling and legs’ loads balancing simultaneously.By using the proposed methods,the stability,precision and efficiency of auto-leveling control process can be improved.

Load Balancing Routing Algorithm Based on Extended Link States in LEO Constellation Network

As an important part of satellite communication network,LEO satellite constellation network is one of the hot research directions.Since the nonuniform distribution of terrestrial services may cause inter-satellite link congestion,improving network load balancing performance has become one of the key issues that need to be solved for routing algorithms in LEO network.Therefore,by expanding the range of available paths and combining the congestion avoidance mechanism,a load balancing routing algorithm based on extended link states in LEO constellation network is proposed.Simulation results show that the algorithm achieves a balanced distribution of traffic load,reduces link congestion and packet loss rate,and improves throughput of LEO satellite network.

Novel Models and Algorithms of Load Balancing for Variable-structured Collaborative Simulation under HLA/RTI

High level architecture(HLA) is the open standard in the collaborative simulation field. Scholars have been paying close attention to theoretical research on and engineering applications of collaborative simulation based on HLA/RTI, which extends HLA in various aspects like functionality and efficiency. However, related study on the load balancing problem of HLA collaborative simulation is insufficient. Without load balancing, collaborative simulation under HLA/RTI may encounter performance reduction or even fatal errors. In this paper, load balancing is further divided into static problems and dynamic problems. A multi-objective model is established and the randomness of model parameters is taken into consideration for static load balancing, which makes the model more credible. The Monte Carlo based optimization algorithm(MCOA) is excogitated to gain static load balance. For dynamic load balancing, a new type of dynamic load balancing problem is put forward with regards to the variable-structured collaborative simulation under HLA/RTI. In order to minimize the influence against the running collaborative simulation, the ordinal optimization based algorithm(OOA) is devised to shorten the optimization time. Furthermore, the two algorithms are adopted in simulation experiments of different scenarios, which demonstrate their effectiveness and efficiency. An engineering experiment about collaborative simulation under HLA/RTI of high speed electricity multiple units(EMU) is also conducted to indentify credibility of the proposed models and supportive utility of MCOA and OOA to practical engineering systems. The proposed research ensures compatibility of traditional HLA, enhances the ability for assigning simulation loads onto computing units both statically and dynamically, improves the performance of collaborative simulation system and makes full use of the hardware resources.