a common weighted algorithm library
Go
Latest commit 3a1cb72 Dec 4, 2016 @smallnest change for loop
Permalink
Failed to load latest commit information.
.gitignore
.travis.yml
LICENSE
README.md
benchmark_test.go
example_test.go
weighted.go
weighted1.go
weighted1_test.go
weighted2.go
weighted2_test.go

README.md

License GoDoc travis Coverage Go Report Card

Package weighted implements the smooth weighted round-robin balancing algorithm. This algorithm is implemented in Nginx: https://github.com/phusion/nginx/commit/27e94984486058d73157038f7950a0a36ecc6e35.

Algorithm is as follows: on each peer selection we increase current_weight of each eligible peer by its weight, select peer with greatest current_weight and reduce its current_weight by total number of weight points distributed among peers.

In case of { 5, 1, 1 } weights this gives the following sequence of current_weight's: (a, a, b, a, c, a, a)

This is an example to use it:

package main

import "fmt"

func ExampleW1_Next() {
    w := &W1{}
    w.Add("a", 5)
    w.Add("b", 2)
    w.Add("c", 3)

    for i := 0; i < 10; i++ {
        fmt.Printf("%s ", w.Next())
    }
}

And this lib has provides another weighted round robin algorithm. This algorithm is used in LVS. It has better performance but it is not so more smooth than the first algorithm, so you can select one algorithm according to your case. It is used like the first:

package main

import "fmt"

func ExampleW2_Next() {
    w := &W2{}
    w.Add("a", 5)
    w.Add("b", 2)
    w.Add("c", 3)

    for i := 0; i < 10; i++ {
        fmt.Printf("%s ", w.Next())
    }
}