MonickerHash: A Decentralized Load-Balancing Algorithm for Resource/Traffic Distribution

We in this paper tackle the load-balancing problem that has already been extensively studied for decades. We present MonickerHash, a novel and simple yet effective algorithm that can be executed in a decentralized manner and consistently distributes resource/traffic across multiple destinations. MonickerHash is built on a single hashing function and only relies on the identities of the resource/traffic and destinations. It can be expressed with 10 lines of code. Having a complexity of O(n) for mapping and for lookup, MonickerHash can be applied in a broad range of areas, including storage systems, network traffic distribution, and workload placement, etc. We also discuss the correctness of MonickerHash and demonstrate its the advantages through an experimental evaluation in selected scenarios.