Show exactly how round-robin splits requests across a pool, including the remainder servers and the resulting per-server load.
Round robin walks the pool in order, so each server receives the integer quotient of the request count and the first few servers absorb the remainder. Because the split ignores server capability, the per-server rate is simply the total divided by the pool size. Round robin only balances load when every server is identical and every request costs the same — the failover column is the one that decides whether the pool survives a node loss.
Round Robin Distribution
requests per server = floor(requests ÷ servers); the first (requests mod servers) servers take one extra request; per-server rate = request rate ÷ servers.
requests per server = floor(requests ÷ servers); the first (requests mod servers) servers take one extra request; per-server rate = request rate ÷ servers. Round robin walks the pool in order, so each server receives the integer quotient of the request count and the first few servers absorb the remainder. Because the split ignores server capability, the per-server rate is simply the total divided by the pool size.
Round robin only balances load when every server is identical and every request costs the same — the failover column is the one that decides whether the pool survives a node loss.
This calculator takes 4 inputs: Requests in the measurement window, Servers in the pool, Request rate at peak, Capacity per server. The pre-filled defaults are a realistic starting point — replace them with figures from your own environment for a result you can act on.