title: Is there a consistent hashing algorithm that support zero remapping of keys?
body: <p>I understand with the classical consistent caching algorithm, when adding/removing a node, some keys have to be remapped to different nodes. Is there an algorithm that supports no remapping at all, if I loosen some requirements?</p>
  <p>In my application, I want to incrementally assign keys to nodes:</p>
  <ol>
  <li><p>Once a key has been assigned to a node, it stays there forever.</p>
  </li>
  <li><p>Nodes are added but not removed. a node is never down after being added - assume a replication/backup mechanism at work.</p>
  </li>
  <li><p>Keys don't need to be distributed uniformly among the nodes. Best-effort is OK: when a new node is added, more new keys are assigned to it than the old nodes.</p>
  <p>Is there an algorithm for this scenario?</p>
  </li>
  </ol>