Analysis of round-robin load-balancing algorithm with adaptive and predictive approaches

2016 ◽  
Author(s):  
Furqan Alam ◽  
Vijey Thayananthan ◽  
Iyad Katib
Keyword(s):  
Load Balancing ◽  
Round Robin ◽  
Load Balancing Algorithm ◽  
Predictive Approaches

scholarly journals Enhanced Weighted Round Robin Load Balancing Algorithm in Cloud Computing

2019 ◽  
Vol 8 (9S2) ◽  
pp. 148-151
Keyword(s):  
Cloud Computing ◽  
Load Balancing ◽  
Task Assignment ◽  
Round Robin ◽  
Utility Computing ◽  
Distributed Environment ◽  
Dynamic Task ◽  
Computing Model ◽  
Network Load ◽  
Load Balancing Algorithm

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.

scholarly journals An Implementation for a Prediction based Internet Load balancing Algorithm

2021 ◽  
Author(s):  
Shaik Aftaab Zia
Keyword(s):  
Load Balancing ◽  
Web Application ◽  
Speech Synthesis ◽  
Round Robin ◽  
Resource Utilisation ◽  
Dynamic Information ◽  
Rule Based ◽  
Dynamic Algorithms ◽  
Text To Speech Synthesis ◽  
Load Balancing Algorithm

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

scholarly journals An Implementation for a Prediction based Internet Load balancing Algorithm

2021 ◽  
Author(s):  
Shaik Aftaab Zia
Keyword(s):  
Load Balancing ◽  
Web Application ◽  
Speech Synthesis ◽  
Round Robin ◽  
Resource Utilisation ◽  
Dynamic Information ◽  
Rule Based ◽  
Dynamic Algorithms ◽  
Text To Speech Synthesis ◽  
Load Balancing Algorithm

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

scholarly journals Load balancing strategies in software defined networks

2018 ◽  
Vol 7 (3) ◽  
pp. 1854 ◽  
Author(s):  
Gourav Shrivastava ◽  
Praveen Kaushik ◽  
R. K.Pateriya
Keyword(s):  
Load Balancing ◽  
Dynamic Load ◽  
Round Robin ◽  
Dynamic Load Balancing ◽  
Data Traffic ◽  
Network Resources ◽  
Data Plane ◽  
Full Capacity ◽  
Load Balancing Algorithm ◽  
Networking Technology

In the past few years, network requirements have been changing frequently as the amount of data traffic increasing exponentially so it is difficult to utilize the full capacity of network resources. Software Defined Networking (SDN) is emerging as a new networking technology which decouples the control plane from the data plane in the network devices. Separation of control and data plane allows a network administrator a better control over network management and also enables new development through network programmability. Presently Open-Flow is the most popular SDN protocol which provides communication between network devices and controller. In this paper, the Round Robin algorithm is compared with the Dynamic load balancing algorithm using the OpenFlow protocol in SDN under varying load conditions of TCP and UDP traffic. Experimental analysis shows that the dynamic load balancing strategy works better than the Round Robin load balancing.  

Sign in / Sign up

Export Citation Format

Share Document