BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm
<|reference_start|>BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm: Consistent hashing is employed in distributed systems and networking applications to evenly and effectively distribute data across a cluster of nodes. This paper introduces BinomialHash, a consistent hashing algorithm that operates in constant time and requires minimal memory. We provide a detailed explanation of the algorithm, offer a pseudo-code implementation, and formally establish its strong theoretical guarantees.<|reference_end|>
@article{coluzzi2024binomialhash:,
    title={BinomialHash: A Constant Time, Minimal Memory Consistent Hash Algorithm},
    author={Massimo Coluzzi, Amos Brocco, Alessandro Antonucci},
    journal={arXiv preprint arXiv:2406.19836},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.19836},
    primaryClass={cs.DC cs.DS}
}