arXiv:1812.09674cs.DS
AnchorHash: A Scalable Consistent Hash
Abstract
Consistent hashing (CH) is a central building block in many networking applications, from datacenter load-balancing to distributed storage. Unfortunately, state-of-the-art CH solutions cannot ensure full consistency under arbitrary changes and/or cannot scale while maintaining reasonable memory footprints and update times. We present AnchorHash, a scalable and fully-consistent hashing algorithm. AnchorHash achieves high key lookup rates, a low memory footprint, and low update times. We formally establish its strong theoretical guarantees, and present advanced implementations with a memory footprint of only a few bytes per resource. Moreover, extensive evaluations indicate that it outperforms state-of-the-art algorithms, and that it can scale on a single core to 100 million resources while still achieving a key lookup rate of more than 15 million keys per second.
I don't see how anyone can read that web page with the popup distraction in the corner. Every couple seconds it jumps and says "Bookmarked by X" or "New member X" and pulls my eyes away from the text. Direct PDF link: https://export.arxiv.org/pdf/1812.09674.pdf
dpeduView on HNParent context
Or https://arxiv.org/abs/1812.09674 as it's the citation link (which is what I submitted to HN before seeing this post). Either way the link should probably be changed to one of these two as opposed to what OP has submitted.
gbrown_View on HNParent context
This looks like it's just copied from https://arxiv.org/abs/1812.09674.
dangView on HNParent context