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 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.

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.

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.

Spatial Load Balancing in Wide-Area Wireless Networks

Load balancing is typically used in the frequency domain of cellular wireless networks to balance paging, access, and traffic load across the available bandwidth. In this paper, we extend load balancing into the spatial domain, and we develop two approaches--network load balancing and single-carrier multilink--for spatial load balancing. Although these techniques are mostly applied to cellular wireless networks and Wi-Fi networks, we show how they can be applied to EV-DO, a 3G cellular data network. When a device has more than one candidate server, these techniques can be used to determine the quality of the channel between a server and the device and to determine the Ipad on each server. The proposed techniques leverage the advantages of existing EV-DO network architecture and are fully backward compatible. Network operators can substantially increase network capacity and improve user experience by using these techniques. Combining load balancing in the frequency and spatial domains improves connectivity within a network and allows resources to be optimally allocated according to the p-fair criterion. Combined load balancing further improves performance.

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.

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.

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.

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.

Load Balancing Algorithm for Migrating Switches in Software-Dened Vehicular Networks

In Software-Dened Networks(SDN),the divergence of the control interface from the data plane provides a unique platform to develop a programmable and exible network.A single controller,due to heavy load trafc triggered by different intelligent devices can not handle due to it’s restricted capability.To manage this,it is necessary to implement multiple controllers on the control plane to achieve quality network performance and robustness.The ow of data through the multiple controllers also varies,resulting in an unequal distribution of load between different controllers.One major drawback of the multiple controllers is their constant conguration of the mapping of the switch-controller,quickly allowing unequal distribution of load between controllers.To overcome this drawback,Software-Dened Vehicular Networking(SDVN)has evolved as a congurable and scalable network,that has quickly achieved attraction in wireless communications from research groups,businesses,and industries administration.In this paper,we have proposed a load balancing algorithm based on latency for multiple SDN controllers.It acknowledges the evolving characteristics of real-time latency vs.controller loads.By choosing the required latency and resolving multiple overloads simultaneously,our proposed algorithm solves the loadbalancing problems with multiple overloaded controllers in the SDN control plane.In addition to the migration,our algorithm has improved 25%latency as compared to the existing algorithms.

Optimized Load Balancing Technique for Software Defined Network

Software-defined networking is one of the progressive and prominent innovations in Information and Communications Technology.It mitigates the issues that our conventional network was experiencing.However,traffic data generated by various applications is increasing day by day.In addition,as an organization’s digital transformation is accelerated,the amount of information to be processed inside the organization has increased explosively.It might be possible that a Software-Defined Network becomes a bottleneck and unavailable.Various models have been proposed in the literature to balance the load.However,most of the works consider only limited parameters and do not consider controller and transmission media loads.These loads also contribute to decreasing the performance of Software-Defined Networks.This work illustrates how a software-defined network can tackle the load at its software layer and give excellent results to distribute the load.We proposed a deep learning-dependent convolutional neural networkbased load balancing technique to handle a software-defined network load.The simulation results show that the proposed model requires fewer resources as compared to existing machine learning-based load balancing techniques.

Load balancing strategy of heterogeneous wireless networks based on multi-hop routing algorithm of ad hoc network

Because of different system capacities of base station （BS） or access point （AP） and ununiformity of traffic distribution in different cells, quantities of new call users may be blocked in overloaded cell in communication hot spots. Whereas in some neighboring under-loaded cells, bandwidth may be superfluous because there are only few users to request services. In order to raise resource utilization of the whole heterogeneous networks, several novel load balancing strategies are proposed, which combine the call ad- mission control policy and multi-hop routing protocol of ad-hoc network for load balancing. These loadbalancing strategies firstly make a decision whether to admit a new call or not by considering some parameters like load index and route cost, etc., and then transfer the denied users into neighboring under-loaded cell with surplus channel according to optimum multi-hop routing algorithm. Simulation results show that the proposed load balancing strategies can distribute traffics to the whole heterogeneous wireless netorks, improve the load balance index efficiently, and avoid the call block phenomenon almost absolutely.

Adaptive load balancing scheme in ad hoc networks

An adaptive load balancing scheme is proposed to balance the load in ad hoc networks. The new scheme can be applied in most on-demand routing protocols resulting in significant performance improvement. The proposed scheme is applied to the ad hoc on-demand distance vector （AODV） routing protocol. Simulation results show that the network load is balanced on the whole, and performance in packet loss rate, routing overhead and average end-to-end delay is also improved.

Load Balancing Fat-Tree on Long-Lived Flows:Avoiding Congestion in a Data Center Network

In a data center network （DCN）, load balancing is required when servers transfer data on the same path. This is necessary to avoid congestion. Load balancing is challenged by the dynamic transferral of demands and complex routing control. Because of the distributed nature of a traditional network, previous research on load balancing has mostly focused on improving the performance of the local network; thus, the load has not been optimally balanced across the entire network. In this paper, we propose a novel dynamic load-balancing algorithm for fat-tree. This algorithm avoids congestions to the great possible extent by searching for non-conflicting paths in a centralized way. We implement the algorithm in the popular software-defined networking architecture and evaluate the algorithm＇ s performance on the Mininet platform. The results show that our algorithm has higher bisection band- width than the traditional equal-cost multi-path load-balancing algorithm and thus more effectively avoids congestion.

Elite Opposition Based Metaheuristic Framework for Load Balancing in LTE Network

In present scenario of wireless communications,Long Term Evolution(LTE)based network technology is evolved and provides consistent data delivery with high speed andminimal delay through mobile devices.The traffic management and effective utilization of network resources are the key factors of LTE models.Moreover,there are some major issues in LTE that are to be considered are effective load scheduling and traffic management.Through LTE is a depraved technology,it is been suffering from these issues.On addressing that,this paper develops an Elite Opposition based Spider Monkey Optimization Framework for Efficient Load Balancing(SMO-ELB).In this model,load computation of each mobile node is done with Bounding Theory based Load derivations and optimal cell selection for seamless communication is processed with Spider Monkey Optimization Algorithm.The simulation results show that the proposed model provides better results than exiting works in terms of efficiency,packet delivery ratio,Call Dropping Ratio(CDR)and Call Blocking Ratio(CBR).

Artificial Intelligence Based Reliable Load Balancing Framework in Software-Defined Networks

Software-defined networking(SDN)plays a critical role in transforming networking from traditional to intelligent networking.The increasing demand for services from cloud users has increased the load on the network.An efficient system must handle various loads and increasing needs representing the relationships and dependence of businesses on automated measurement systems and guarantee the quality of service(QoS).Themultiple paths from source to destination give a scope to select an optimal path by maintaining an equilibrium of load using some best algorithms.Moreover,the requests need to be transferred to reliable network elements.To address SDN’s current and future challenges,there is a need to know how artificial intelligence(AI)optimization techniques can efficiently balance the load.This study aims to explore two artificial intelligence optimization techniques,namely Ant Colony Optimization(ACO)and Particle Swarm Optimization(PSO),used for load balancing in SDN.Further,we identified that a modification to the existing optimization technique could improve the performance by using a reliable link and node to form the path to reach the target node and improve load balancing.Finally,we propose a conceptual framework for SDN futurology by evaluating node and link reliability,which can balance the load efficiently and improve QoS in SDN.

Load Balancing in IP/MPLS Networks: A Survey

The present era has witnessed tremendous growth of the Internet and various applications that are supported by it. There is an enormous pressure on Internet Service Providers (ISPs) to make available adequate services for the traffics like VoIP and Video on demand. Since the resources like computing power, bandwidth etc. are limited, the traffic needs to be engineered to properly exploit them. Due to these limitations, terms like Traffic Engineering, Quality of Service (QoS) came into existence. Traffic Engineering broadly includes techniques like multipath routing & traffic splitting to balance the load among different paths. In this document, we survey various techniques proposed for load balancing that are available on the Internet. We here try not to be exhaustive but analyze the important techniques in the literature. Present survey would help to give a new direction to the research in this realm.

Load Balancing in WDM Optical Networks with and without Wavelength-Continuity Constraints

In practical optical networks, there is often the same number of wavelengths in a fiber. But if it is not carefully designed, there will be much difference in link load among different fibers, and unnecessary wavelengths will be needed. This paper investigated this load balancing issues to minimize the wavelength requirements. Both Integer Linear Programming (ILP) and heuristic algorithms were presented to solve such a problem in WDM optical networks with or without wavelength continuity constraints.

Adaptive Server Load Balancing in SDN Using PID Neural Network Controller

Web service applications are increasing tremendously in support of high-level businesses.There must be a need of better server load balancing mechanism for improving the performance of web services in business.Though many load balancing methods exist,there is still a need for sophisticated load bal-ancing mechanism for not letting the clients to get frustrated.In this work,the ser-ver with minimum response time and the server having less traffic volume were selected for the aimed server to process the forthcoming requests.The Servers are probed with adaptive control of time with two thresholds L and U to indicate the status of server load in terms of response time difference as low,medium and high load by the load balancing application.Fetching the real time responses of entire servers in the server farm is a key component of this intelligent Load balancing system.Many Load Balancing schemes are based on the graded thresholds,because the exact information about the networkflux is difficult to obtain.Using two thresholds L and U,it is possible to indicate the load on particular server as low,medium or high depending on the Maximum response time difference of the servers present in the server farm which is below L,between L and U or above U respectively.However,the existing works of load balancing in the server farm incorporatefixed time to measure real time response time,which in general are not optimal for all traffic conditions.Therefore,an algorithm based on Propor-tional Integration and Derivative neural network controller was designed with two thresholds for tuning the timing to probe the server for near optimal perfor-mance.The emulation results has shown a significant gain in the performance by tuning the threshold time.In addition to that,tuning algorithm is implemented in conjunction with Load Balancing scheme which does not tune thefixed time slots.