mirror of
https://github.com/haproxy/haproxy.git
synced 2026-05-21 09:25:29 -04:00
a59e6e5efd
The "id" hash-key scales the ID by a factor of 16 that tries to leave room between the nodes on the 32-bit space to permit smooth weight variations (e.g. during slowstart). However this does not deal well with overlaps between server IDs. For example, assigning IDs that are only multiples of 256 million to 16 servers yields traffic only on one since in practice they all have the same 28 lower bits. The new "id32" hash key bridges this gap by using the full 32-bit ID of the server as the key. On the other hand, the user must be careful not to switch the hash function to "none" when using incremental IDs because in this case they might be very poorly distributed. But this can be convenient for automated provisionning systems which assign IDs themselves, as the full 32 bits are used now. |
||
|---|---|---|
| .. | ||
| design-thoughts | ||
| internals | ||
| lua-api | ||
| 51Degrees-device-detection.txt | ||
| acl.fig | ||
| coding-style.txt | ||
| configuration.txt | ||
| cookie-options.txt | ||
| DeviceAtlas-device-detection.txt | ||
| gpl.txt | ||
| haproxy.1 | ||
| HAProxyCommunityEdition_60px.png | ||
| haterm.txt | ||
| intro.txt | ||
| lgpl.txt | ||
| linux-syn-cookies.txt | ||
| lua.txt | ||
| management.txt | ||
| netscaler-client-ip-insertion-protocol.txt | ||
| network-namespaces.txt | ||
| peers-v2.0.txt | ||
| peers.txt | ||
| proxy-protocol.txt | ||
| queuing.fig | ||
| regression-testing.txt | ||
| seamless_reload.txt | ||
| SOCKS4.protocol.txt | ||
| SPOE.txt | ||
| WURFL-device-detection.txt | ||
