4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Load Balancing Algorithms Explained with Cod

#14 System Design - Load Balancing Algorithms
ASHISH PRATAP SINGH
JUN 02, 2024

125 5 9 Sha

Load balancing is the process of distributing incoming network traffic across

multiple servers to ensure that no single server is overwhelmed.

By evenly spreading the workload, load balancing aims to prevent overload on a sin
server, enhance performance by reducing response times and improve availability

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 1/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

rerouting traffic in case of server failures.

There are several algorithms to achieve load balancing, each with its pros and cons.

In this article, we will dive into the most commonly used load balancing algorithms
how they work, when to use them, their benefits/drawbacks and how to implement
them in code.

If you’re finding this newsletter valuable and want to deepen your learning, conside
becoming a paid subscriber.

As a paid subscriber, you'll receive an exclusive deep-dive article every week, acces
a structured System Design Resource (100+ topics and interview questions), and oth
premium perks.

Algorithm 1: Round Robin

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 2/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

How it Works:
1. A request is sent to the first server in the list.

2. The next request is sent to the second server, and so on.

3. After the last server in the list, the algorithm loops back to the first server.

When to Use:
When all servers have similar processing capabilities and are equally capable of
handling requests.

When simplicity and even distribution of load is more critical.

Benefits:
Simple to implement and understand.

Ensures even distribution of traffic.

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 3/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Drawbacks:
Does not consider server load or response time.

Can lead to inefficiencies if servers have different processing capabilities.

Implementation:

Code Link

In this implementation, the RoundRobin class maintains a list of servers and keeps
track of the current index.

The get_next_server() updates the index and returns the next server in the cycle

Algorithm 2: Weighted Round Robin

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 4/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

How it Works:
1. Each server is assigned a weight based on their processing power or available
resources.

2. Servers with higher weights receive a proportionally larger share of incoming

requests.

When to use:
When servers have different processing capabilities or available resources.

When you want to distribute the load based on the capacity of each server.

Benefits:
Balances load according to server capacity.

More efficient use of server resources.

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 5/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Drawbacks:
Slightly more complex to implement than simple Round Robin.

Does not consider current server load or response time.

Implementation:

Code Link

In this implementation, the WeightedRoundRobin class takes a list of servers and

their corresponding weights.

The get_next_server() method runs an infinite loop to find a suitable server bas
on the weights, ensuring that servers with higher weights receive more requests.

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 6/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

The algorithm keeps track of the current weight and adjusts it in each iteration to
maintain the desired distribution ratio.

Example: if the weights are [5, 1, 1], Server 1 will be selected 5 times more often
than Server 2 or Server 3.

Algorithm 3: Least Connections

How it Works:
1. Monitor the number of active connections on each server.

2. Assigns incoming requests to the server with the least number of active
connections.

When to use:

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 7/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

When you want to distribute the load based on the current number of active
connections.

When servers have similar processing capabilities but may have different levels
concurrent connections.

Benefits:
Balances load more dynamically based on current server load.

Helps prevent any server from becoming overloaded with a high number of acti
connections.

Drawbacks:
May not be optimal if servers have different processing capabilities.

Requires tracking active connections for each server.

Implementation:

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 8/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Code Link

In this example, the LeastConnections class maintains a map of servers and the
number of active connections for each server.

The get_next_server() method selects a random server with the least number of
connections and increments the connection count for that server.

The release_connection() method is called when a connection is closed,

decrementing the connection count for the corresponding server.

Algorithm 4: Least Response Time

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 9/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

How It Works:
Monitors the response time of each server

Assigns incoming requests to the server with the fastest response time.

When to Use:
When you have servers with varying response times and want to route requests
the fastest server.

Benefits:
Minimizes overall latency by selecting the server with the fastest response time

Can adapt dynamically to changes in server response times.

Helps improve the user experience by providing quick responses.

Drawbacks:

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 10/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Requires accurate measurement of server response times, which can be

challenging in distributed systems.

May not consider other factors such as server load or connection count.

Implementation:

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 11/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 12/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Code Link

In this example, the LeastResponseTime class maintains a list of servers and keeps
track of the response time for each server.

The get_next_server() method selects the server with the least response time. T
update_response_time() method is called after each request to update the respon
time for the corresponding server.

To simulate the response time, we use a simulate_response_time() function tha

introduces a random delay to mimic the server's response time.

In a real-world scenario, you would measure the actual response time of each server

Algorithm 5: IP Hash

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 13/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

How It Works:
Calculates a hash value from the client’s IP address and uses it to determine the
server to route the request.

When to Use:
When you need session persistence, as requests from the same client are always
directed to the same server.

Benefits:
Simple to implement.

Useful for applications that require sticky sessions.

Drawbacks:

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 14/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

Can lead to uneven load distribution if certain IP addresses generate more traffi
than others.

Lacks flexibility if a server goes down, as the hash mapping may need to be
reconfigured.

Implementation:

Code Link

In this implementation, the IPHash class takes a list of servers.

The get_next_server() method calculates the MD5 hash of the client's IP addres
and uses the modulo operator to determine the index of the server to which the
request should be routed.

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 15/18
4/21/25, 2:32 PM Load Balancing Algorithms Explained with Code (and Visuals)

This ensures that requests from the same IP address are always directed to the sam
server.

Summary:
Round Robin: Simple and even distribution, best for homogeneous servers.

Weighted Round Robin: Distributes based on server capacity, good for

heterogeneous environments.

Least Connections: Dynamically balances based on load, ideal for varying

workloads.

Least Response Time: Optimizes for fastest response, best for environments w
varying server performance.

IP Hash: Ensures session persistence, useful for stateful applications.

Choosing the right load balancing algorithm depends on the specific needs and
characteristics of your system, including server capabilities, workload distribution,
and performance requirements.

Thank you for reading!

If you found it valuable, hit a like ❤️ and consider subscribing for more such conte
every week.

If you have any questions or suggestions, leave a comment.

This post is public so feel free to share it.

https://blog.algomaster.io/p/load-balancing-algorithms-explained-with-code 16/18