[infinispan-dev] Google load balancer design

http://blog.acolyer.org/2016/03/21/maglev-a-fast-and-reliable-software-ne... Interesting read. Some data points I extracted. 350 ns per parquet. Ensuring a 300us during load. Some math I was not aware of: [quote] -- Let N be the size of a VIP’s backend pool. A table is constructed with M entries, where M is a prime number and M > 100 * N, which will ensure at most a 1% difference in hash space assigned to backends. -- Might be interesting in our virtual nodes logic. The segment size might not be too friendly here though. They do use try to ensure relative stability of the targeted backend for a given key even when the pool of backend changes (e.g. one server down) Emmanuel