Till KTH:s startsida Till KTH:s startsida

Distributed Hash Tables

This is an introduction to large scale storage systems using distributed hash tables. Why do we use hashing at all and what is the trade-off between fast lookup and management of routing tables. What do we do when nodes die and where do we store the replicas.

Visa tidigare händelser (2)

Johan Montelius redigerade 17 oktober 2014

This is an introduction to large scale storage systems using distributed hash tables. Why do we use hashing at all and what is the trade-off between fast lookup and management of routing tables. What do we do when nodes die and where do we store the replicas.


* p2p.pdf
* dht.pdf