Weighted Round-Robin Load Balancing Algorithm for Software-Defined Network

Author(s):  
Shashidhara B. Vyakaranal ◽  
Jayalaxmi G. Naragund
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%.


The cloud/utility computing model requires a dynamic task assignment to cloud sites with the goal that the performance and demand handling is done as effectively as would be prudent. Efficient load balancing and proper allocation of resources are vital systems to improve the execution of different services and make legitimate usage of existing assets in the cloud computing atmosphere. Consequently, the cloud-based infrastructure has numerous kinds of load concerns such as CPU load, server load, memory drain, network load, etc. Thus, an appropriate load balancing system helps in realizing failures, reducing backlog problems, adaptability, proper resource distribution, expanding dependability and client fulfillment and so forth in distributed environment. This thesis reviewed various popular load balancing algorithms. Modified round robin algorithms are popularly employed by various giant companies for scheduling issues and load balancing. An enhanced weighted round robin algorithm is discussed in this paper concentrating on efficient load balancing and effective task scheduling and resource management.


2021 ◽  
Author(s):  
Shaik Aftaab Zia

<div>Internet load balancing algorithms can be categorised into static and dynamic algorithms. Static algorithms like Round Robin and IP hash are rule based and do not take into account dynamic information like load on individual servers. Dynamic algorithms like Least connections take this into account and aim to distribute traffic more optimally, but lead to requirement of monitors or polling mechanisms to obtain this information. Predictive load balancing algorithms aim to remove this requirement by trying to predict load induced on servers due to requests rather than measuring it directly. We aim to provide an improved implementation of algorithm described by Patil et al.[1] and compare this implementation with a static algorithm like Round Robin in terms of performance and resource utilisation. This implementation is for a web application which does text-to-speech synthesis.</div>


2021 ◽  
Author(s):  
Shaik Aftaab Zia

<div>Internet load balancing algorithms can be categorised into static and dynamic algorithms. Static algorithms like Round Robin and IP hash are rule based and do not take into account dynamic information like load on individual servers. Dynamic algorithms like Least connections take this into account and aim to distribute traffic more optimally, but lead to requirement of monitors or polling mechanisms to obtain this information. Predictive load balancing algorithms aim to remove this requirement by trying to predict load induced on servers due to requests rather than measuring it directly. We aim to provide an improved implementation of algorithm described by Patil et al.[1] and compare this implementation with a static algorithm like Round Robin in terms of performance and resource utilisation. This implementation is for a web application which does text-to-speech synthesis.</div>


Sign in / Sign up

Export Citation Format

Share Document