In computer operations, round robin is used in a scheduling algorithm that distributes work evenly among all available resources. This ensures that no single resource is overworked, which can lead to errors and other issues down the line. This is often described as round robin process scheduling.
Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing. As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive).
Round-robin scheduling (Figure 7.151) allocates each task an equal share of the CPU time. In its simplest form, tasks are in a circular queue and when a task's allocated CPU time expires, the task is put to the end of the queue and the new task is taken from the front of the queue.
Why Do We Need Load Balancing Algorithms
Using a load balancing algorithm, we can efficiently distribute the request to the pool of servers. Depending on the different situations Round-Robin
In round robin ,the requests from the client is distributed in the cyclic manner.What is that mean Weighted Round Robin
. Dealing with different configurations of the servers, the administrator can assign the weight or ratio to the server Least Connections
In round-robin and the weighted round-robin Hashing Methods
Hashing algorithms are used in the case of persistant connections(means stick a client to the specific server) Random Algorithm
As the name suggest, the request will be forwarded to random servers. For forwarding the request,load balancer use random number generator Least Response Time Method
Server is selected based on the least reponse time 