aboutsummaryrefslogtreecommitdiffstats
path: root/src/libserver/cfg_rcl.h
diff options
context:
space:
mode:
authorVsevolod Stakhov <vsevolod@highsecure.ru>2014-11-02 21:42:53 +0000
committerVsevolod Stakhov <vsevolod@highsecure.ru>2014-11-02 21:42:53 +0000
commit1e86acfae8cef9b7f0a547aca009a157fee2a1bf (patch)
tree64d26fc9379c3451e9e89bdec65c7e22b92e56d5 /src/libserver/cfg_rcl.h
parent96346543001368d5ee1a3b19a4315ad2a5fd3e13 (diff)
downloadrspamd-1e86acfae8cef9b7f0a547aca009a157fee2a1bf.tar.gz
rspamd-1e86acfae8cef9b7f0a547aca009a157fee2a1bf.zip
Add consistent hash test.
P value is calculated as following: when we add/remove M upstreams from the list, the probability of hash miss should be close to the relation N / (N + M), where N is the size of the previous upstreams list. So far, the algorithm described in http://arxiv.org/abs/1406.2294 shows p value more than 0.99.
Diffstat (limited to 'src/libserver/cfg_rcl.h')
0 files changed, 0 insertions, 0 deletions