论文信息 - Multi-probe consistent hashing

Multi-probe consistent hashing

We describe a consistent hashing algorithm which performs multiple lookups per key in a hash table of nodes. It requires no additional storage beyond the hash table, and achieves a peak-to-average load ratio of 1 + epsilon with just 1 + 1/epsilon lookups per key.

Ben Appleton | Michael O'Reilly | Ben Appleton | Michael O'Reilly

[1] M. Habib. Probabilistic methods for algorithmic discrete mathematics , 1998 .

[2] Harald Cram'er,et al. Sur un nouveau théorème-limite de la théorie des probabilités , 2018 .

[3] Wei Wang,et al. Hash-Based Virtual Hierarchies for Scalable Location Service in Mobile Ad-hoc Networks , 2009, Mob. Networks Appl..

[4] Christian Schindelhauer,et al. Weighted distributed hash tables , 2005, SPAA '05.

[5] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .

[6] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[7] David Thaler,et al. Using name-based mappings to increase hit rates , 1998, TNET.

[8] John Lamping,et al. A Fast, Minimal Memory, Consistent Hash Algorithm , 2014, ArXiv.

[9] David R. Karger,et al. Consistent hashing and random trees: distributed caching protocols for relieving hot spots on the World Wide Web , 1997, STOC '97.