Probably an implementation detail of consistent hashing, IIUC, under ideal conditions, with N servers and K hash functions, we could expect to see NK evenly distributed nodes on the hash ring.
but what if the hash of my servers collide with each other?
- ignore them? probably won't work? in the extreme case, all K hashes of my server could be overshadowed by others?
- some sort of collision resolution? with my limited hashtable knowledge, it has to be some kind of OpenAddressing?