mirror of
http://git.haproxy.org/git/haproxy.git/
synced 2024-12-13 23:14:46 +00:00
b625a085d8
This round robin algorithm was written from trees, so that we do not have to recompute any table when changing server weights. This solution allows on-the-fly weight adjustments with immediate effect on the load distribution. There is still a limitation due to 32-bit computations, to about 2000 servers at full scale (weight 255), or more servers with lower weights. Basically, sum(srv.weight)*4096 must be below 2^31. Test configurations and an example program used to develop the tree will be added next. Many changes have been brought to the weights computations and variables in order to accomodate for the possiblity of a server to be running but disabled from load balancing due to a null weight. |
||
---|---|---|
.. | ||
common | ||
import | ||
proto | ||
types |