<p>Answering my own question.</p>

<p>I found that the authors never published an extended version with proofs.</p>

<p>The closest thing to an extended paper is,</p>

<blockquote>
  <p>Rina Panigrahy. <strong>Relieving hot spots on the worldwide web</strong>. 1997. <a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.17.8503&amp;rep=rep1&amp;type=pdf" rel="nofollow noreferrer">1</a></p>
</blockquote>

<p>which was the Master's thesis of Rina Panigrahy (under Prof. Karger &amp; Prof. Smith), who's also a co-author of the paper under discussion.  It is a good, detailed reference to the original paper with all the proofs I needed.</p>

CC BY-SA 3.0
2018-01-08T09:25:59.110Z
2018-01-08T09:25:59.110Z
ngub05
<p>I guess this <a href="https://dspace.mit.edu/handle/1721.1/9947#files" rel="nofollow noreferrer">https://dspace.mit.edu/handle/1721.1/9947#files</a> is what you are looking for.</p>

CC BY-SA 3.0
2017-11-20T13:20:03.683Z
2017-11-20T13:20:03.683Z
wang zhihao
<p>I've been reading the following paper:</p>

<ul>
<li>David Karger, Eric Lehman, Tom Leighton, Rina Panigrahy, Mathew Levine, Daniel Lewin, "<a href="http://doi.acm.org/10.1145/258533.258660" rel="nofollow">Consistent Hashing and Random Trees: Distributed Caching Protocols for Relieving Hot Spots on the World Wide Web</a>", 1997. <a href="https://www.akamai.com/us/en/multimedia/documents/technical-publication/consistent-hashing-and-random-trees-distributed-caching-protocols-for-relieving-hot-spots-on-the-world-wide-web-technical-publication.pdf" rel="nofollow">pdf</a></li>
</ul>

<p>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?</p>

CC BY-SA 3.0
2015-10-15T18:53:21.520Z
Email the authors?
Thomas Steinke
<ds.algorithms><reference-request><randomized-algorithms><hash-function><cache-oblivious>
Extended version of the paper "Consistent Hashing and Random Trees" with proofs
ngub05
# Extended version of the paper "Consistent Hashing and Random Trees" with proofs

(Asked by: username_0 on 2015-10-15)

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](http://doi.acm.org/10.1145/258533.258660)", 1997. [pdf](https://www.akamai.com/us/en/multimedia/documents/technical-publication/consistent-hashing-and-random-trees-distributed-caching-protocols-for-relieving-hot-spots-on-the-world-wide-web-technical-publication.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?

**Tags:** ds.algorithms, reference-request, randomized-algorithms, hash-function, cache-oblivious
> **Comments:**
> **username_1**: Email the authors?  

---

## 2 answers

### Answer by username_0 on 2018-01-08. Score: 2 | Accepted answer

Answering my own question.

I found that the authors never published an extended version with proofs.

The closest thing to an extended paper is,

> Rina Panigrahy. **Relieving hot spots on the worldwide web**. 1997. [1](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.17.8503&rep=rep1&type=pdf)

which was the Master's thesis of Rina Panigrahy (under Prof. Karger & Prof. Smith), who's also a co-author of the paper under discussion. It is a good, detailed reference to the original paper with all the proofs I needed.


---

### Answer by username_2 on 2017-11-20. Score: 1

I guess this <https://dspace.mit.edu/handle/1721.1/9947#files> is what you are looking for.


---

