title: Is there a guaranteed fair variation on consistent hashing?
body: <p>I'm looking for something like <a href="http://en.wikipedia.org/wiki/Consistent_hashing" rel="nofollow">Consistent Hashing</a>, but with a guarantee that a distribution ends up as fair as possible (not just on average for random keys) - is there such a thing and where can I find it if so?</p>
  
  <p><strong>Edit:</strong> In my specific case, the set of keys is known up front (and "small"). Exactly these keys will always be present and must be allocated to exactly one node each at any given point in time.</p>