RepoMirrors/haproxy
1
0
Fork 0
mirror of http://git.haproxy.org/git/haproxy.git/ synced 2025-03-25 04:17:42 +00:00
Code Issues Packages Projects Releases Wiki Activity

[DOC] document the leastconn LB algo

Browse Source
This commit is contained in:
Willy Tarreau 2008-03-17 12:07:56 +01:00
parent db5238d3a4
commit 2d2a7f8fbc
1 changed files with 9 additions and 0 deletions

9
doc/configuration.txt
View File

@ -711,6 +711,15 @@ balance <algorithm> [ <arguments> ]
is dynamic, which means that server weights may be adjusted
on the fly for slow starts for instance.
leastconn The server with the lowest number of connections receives the
connection. Round-robin is performed within groups of servers
of the same load to ensure that all servers will be used. Use
of this algorithm is recommended where very long sessions are
expected, such as LDAP, SQL, TSE, etc... but is not very well
suited for protocols using short sessions such as HTTP. This
algorithm is dynamic, which means that server weights may be
adjusted on the fly for slow starts for instance.
source The source IP address is hashed and divided by the total
weight of the running servers to designate which server will
receive the request. This ensures that the same client IP