Design a load balancer using data structures
Load balancing is a simple way to distribute client requests across a group of servers. A client request is forwarded to each server in turn. The Round Robin algorithm instructs the load balancer to go back to the top of the list and repeat.
The main benefit of the round‑robin load-balancing algorithm is that it is extremely simple to implement. However, it does not always result in the most accurate or efficient distribution of traffic. Because many round‑robin load balancers assume that all servers are the same: currently up, handling the same load, and with the same storage and computing capacity.