Rendezvous hashing is so simple and elegant.
I implemented a library for rendezvous hashing with skeleton in order to get a similar performance as consistent hashing; it gets much more complicated and IMO loses some of the elegance once you add the skeleton. Most of the challenge is that the skeleton structure relies on a tree and so has to be rebalanced sometimes and this means that sometimes you have to move around more keys than ideal. The startegy you can use to perform the rebalancing can become very complicated.
Though the 'virtual nodes' in consistent hashing also add a lot of complexity there.
- rendezvous hashing / consistent hashing
- Hybrid logical clocks
- "Don’t Settle for Eventual: Scalable Causal Consistency for Wide-Area Storage with COPS"
- "Scaling Replicated State Machines with Compartmentalization" (much more recent but really one of my favorite papers)