#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/network-design/load-balancing/round-robin-algorithm

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/network-design/load-balancing/round-robin-algorithm

Repovive

Round-Robin Algorithm - Load Balancing | Network Design | Repovive

Repovive.

Network Design26 sections · 911 units44h total

Open in Course

Round-Robin Algorithm

Sequential distribution

Round-robin sends requests to servers in rotation. First request goes to server $1$ , second to server $2$ , third to server $3$ , then back to server $1$ .

The algorithm runs in $O(1)$ time and uses $O(n)$ space where $n$ is the number of servers.

function roundRobin(servers):
    current = 0
    while true:
        server = servers[current]
        current = (current + 1) mod servers.length
        return server

Round-robin assumes all servers have equal capacity and all requests take equal time. When those assumptions hold, it works well.