load balancing
Round Robin
Distribute requests sequentially across servers in circular order — simplest fair distribution
Total Requests0
Servers4
Next Index0
← NEXT
A
Server A
requestsB
Server B
requestsC
Server C
requestsD
Server D
requests0
→1
→2
→3
// event log
No events yet.
// how it works
- Maintain a pointer to current server index
- Each request goes to servers[index % N]
- Increment index after each request
- Perfectly even distribution over time
// trade-offs
- Dead simple — O(1) per request
- Perfectly fair for uniform workloads
- Ignores server capacity differences
- Ignores current server load