scholarly journals Software Defined Network: Load Balancing Algorithm Design and Analysis

Author(s):  
Senthil Prabakaran ◽  
Ramalakshmi Ramar

Software Defined Network (SDN) cut down the monopolies of producing network devices and their applications. It allows the use of an omniscient controller that manages the overall network and promises for simplifying the configuration and management burden of the traditional Internet Protocol (IP) network. The use of hardware load balancer is a critical issue in conventional IP networks that creates many negative impacts such as the cost affordability, features customization, and availability. Also, the existing load balancing algorithm does not consider the flow size generated by the client nodes. Further, flows are not classified based on the threshold value of the dynamic flow size. The paper proposes to compare the performance of two load balancing algorithms such as flow-based load balancing algorithm and traffic pattern-based load balancing algorithm with distributed controllers' architecture. The result shows that the flow-based load balancing algorithm minimizes response time by 94%, enhances transaction rate by 14% and Traffic pattern-based load balancing algorithm has improved availability by 2.69%.

2011 ◽  
Vol 187 ◽  
pp. 282-286 ◽  
Author(s):  
Xiao Zou

RFID middleware plays an important role in extracting information from RFID reader and sending them to the terminal server. Although the traditional middleware technique solution of RFID can ensure the continuous operation of the system, the cost is too much CPU working load and serious waste of physical resources. The Agent that has played a central role in many application fields can also provide non-centralized and adaptive solutions for load balancing. The paper presented a RFID middleware load balancing method based on Agent according to characteristics of RFID middleware and designed adaptive load allocation algorithm. Two kinds of agents were design, namely information collection Agent and load balancing Agent, to collaborate to complete corresponding strategies of load balancing.


2019 ◽  
Vol 8 (S3) ◽  
pp. 105-108
Author(s):  
P. Neelima ◽  
A. Rama Mohan Reddy

Distribution of workload in a balanced manner is a main challenge in cloud computing system. It distributes workload among multiple nodes, hence resources are properly utilized. This is an optimization problem and a good load balancer should be involved for this strategy to the types of tasks and dynamic environment. To overcome load balancing problem here a Novel Load balancing Algorithm is develop i.e. Dragonfly Algorithm is design and developed, to execute the entire task with shortest completion time and load balanced. Our algorithm will be presented with efficient solution representation, derivation of efficient fitness function (or multi-objective function) along with the usual Dragonfly operators. The performance of the algorithm will be analyzed based on the different evaluation measures. The algorithms like particle swarm optimization (PSO) and Genetic algorithm (GA) will be taken for the comparative analysis.


2018 ◽  
Author(s):  
Dongsheng Zhang

Web traffic is highly jittery and unpredictable. Load balancer plays a significant role in mitigating the uncertainty in web environments. With the growing adoption of cloud computing infrastructure, software load balancer becomes more common in recent years. Current load balancer services distribute the network requests based on the number of network connections to the backend servers. However, the load balancing algorithm fails to work when other resources such as CPU or memory in a backend server saturates. We experimented and discussed the resilience evaluation and enhancement of container-based software load balancer services in cloud computing environments. We proposed a pluggable framework that can dynamically adjust the weight assigned to each backend server based on real-time monitoring metrics.


2018 ◽  
Vol 10 (3) ◽  
pp. 157 ◽  
Author(s):  
Ramadhika Dewanto ◽  
Rendy Munadi ◽  
Ridha Muldina Negara

Equal Cost Multipath Routing (ECMP) is a routing application where all available paths between two nodes is utilized by statically mapping each path to possible traffics between source and destination hosts in a network. This configuration can lead to congestion if there are two or more traffics being transmitted into paths with overlapping links, despite the availability of less busy paths. Software Defined Networking (SDN) has the ability to increase the dynamicity of ECMP by allowing controller to monitor available bandwidths of all links in the network in real-time. The measured bandwidth is then implemented as the basis of the calculation to determine which path a traffic will take.  In this research, a SDN-based ECMP application that can prevent network congestion is made by measuring available bandwidth of each available paths beforehand, thus making different traffics transmitted on non-overlapped paths as much as possible. The proposed scheme increased the throughput by 14.21% and decreased the delay by 99% in comparison to standard ECMP when congestion occurs and has 75.2% lower load standard deviation in comparison to round robin load balancer.


Author(s):  
Noha G. Elnagar ◽  
Ghada F. Elkabbany ◽  
Amr A. Al-Awamry ◽  
Mohamed B. Abdelhalim

<span lang="EN-US">Load balancing is crucial to ensure scalability, reliability, minimize response time, and processing time and maximize resource utilization in cloud computing. However, the load fluctuation accompanied with the distribution of a huge number of requests among a set of virtual machines (VMs) is challenging and needs effective and practical load balancers. In this work, a two listed throttled load balancer (TLT-LB) algorithm is proposed and further simulated using the CloudAnalyst simulator. The TLT-LB algorithm is based on the modification of the conventional TLB algorithm to improve the distribution of the tasks between different VMs. The performance of the TLT-LB algorithm compared to the TLB, round robin (RR), and active monitoring load balancer (AMLB) algorithms has been evaluated using two different configurations. Interestingly, the TLT-LB significantly balances the load between the VMs by reducing the loading gap between the heaviest loaded and the lightest loaded VMs to be 6.45% compared to 68.55% for the TLB and AMLB algorithms. Furthermore, the TLT-LB algorithm considerably reduces the average response time and processing time compared to the TLB, RR, and AMLB algorithms.</span>


2017 ◽  
Vol 8 (1) ◽  
pp. 1-25 ◽  
Author(s):  
Subhadarshini Mohanty ◽  
Prashanta Kumar Patra ◽  
Subasish Mohapatra ◽  
Mitrabinda Ray

Cloud computing is gaining more popularity due to its advantages over conventional computing. It offers utility based services to subscribers on demand basis. Cloud hosts a variety of web applications and provides services on the pay-per-use basis. As the users are increasing in the cloud system, the load balancing has become a critical issue. Scheduling workloads in the cloud environment among various nodes are essential to achieving a better Quality of Service (QOS). It is a prominent area of research as well as challenging to allocate the resources with changeable capacities and functionality. In this paper, a load balancing algorithm using Multi Particle Swarm Optimization (MPSO) has been developed by utilizing the benefits of particle swarm optimization (PSO) algorithm. Proposed approach aims to minimize the task overhead and maximize the resource utilization in a homogenous cloud environment. Performance comparisons are made with Genetic Algorithm (GA), Multi GA, PSO and other popular algorithms on different measures like makespan calculation and resource utilization.


Sign in / Sign up

Export Citation Format

Share Document