Consistent Hashing with Bounded Loads · HackerPapers discussions

Consistent Hashing with Bounded Loads — mentioned by shikhar

Sun, 14 Sep 2025 14:40:13 GMT

How we run it: Auto-scaled Kubernetes deployments, one for each availability zone, currently on m*gd instances which give us local NVMe. The pods are able to easily push GiBps with 1-2 CPUs used — network is the bottleneck so we made it a scaling dimension (thanks KEDA). On the client side, each gateway process uses kube.rs to watch ready endpoints in the same zone as itself, and frequently polls /stats exposed by Cachey for recent network throughput as a load signal. To improve hit rates with key affinity, clients use rendezvous hashing for picking a node, with bounded load…

Paper and discussion history. A mention is not an endorsement.

Consistent Hashing with Bounded Loads — mentioned by nwsm

Mon, 21 Sep 2020 17:34:16 GMT

The key paper (Consistent Hashing with Bounded Loads) referenced in the video: [0]. Here's a similar talk by the same presenter (Andrew Rodland) from HAProxyConf 2019: [1]. It's a bit broader and less iterative/historical which I preferred about the OP. [0] https://arxiv.org/abs/1608.01350

Paper and discussion history. A mention is not an endorsement.

Consistent Hashing with Bounded Loads — mentioned by simonpure

Sun, 12 Nov 2017 11:29:32 GMT

Link to the paper: https://arxiv.org/abs/1608.01350

Paper and discussion history. A mention is not an endorsement.

Consistent Hashing with Bounded Loads — HN submission

Thu, 22 Dec 2016 12:55:16 GMT

Consistent Hashing with Bounded Loads

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.