I've been reading the following paper:
- David Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Mathew Levine, Daniel Lewin, "Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web", 1997. pdf
In the paper the authors mention that the proofs will be available in the "full paper". But I cannot find any extended version of the paper with proofs. Can someone direct me to a version with the proofs?