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.

翻译：一致性哈希被用于分布式系统和网络应用中，以在节点集群间均匀且高效地分配数据。本文介绍了二项式哈希，这是一种在常数时间内运行且仅需最小内存的一致性哈希算法。我们提供了该算法的详细解释，给出了伪代码实现，并正式确立了其坚实的理论保证。