hrw-hash

A minimalistic implementation of the Highest Random Weight (HRW) aka Rendezvous hashing algorithm as described in the "A name-based mapping scheme for Rendezvous", by Thaler and Ravishankar (1996).

The weighted variant of the HRW algorithm is implemented using Logarithmic Method as described in "Weighted distributed hash tables", by Schindelhauer and Schomaker (2005).

Features

• Absolutely minimalistic implementation with sane defaults.
• Allow weighted nodes.
• Allow massive number of nodes (O(log(n)) lookup time, instead of O(n)).
• Optimized for performance and memory usage. No wasted re-hashing.

Usage

The core functionality is exposed via HrwHash:

// TBA

License

MIT