Random Jump Consistent Hashing (RJ-CH) assigns each object to a uniformly random non-full bin instead of the nearest clockwise bin, and the paper proves and simulates that this reduces load variance and full bins compared to Consistent Hashing with Bounded Loads.
Chord: a scalable peer-to-peer lookup protocol for internet applications
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Revisiting Consistent Hashing with Bounded Loads
Random Jump Consistent Hashing (RJ-CH) assigns each object to a uniformly random non-full bin instead of the nearest clockwise bin, and the paper proves and simulates that this reduces load variance and full bins compared to Consistent Hashing with Bounded Loads.