We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is robust under random deletion of nodes. The second has parallel time of log n and message complexity of log^2 n. It is robust under spam induced by a random subset of the nodes. The construction has competitive parameters when compared to other DHT's. Its main merits are its simplicity, its flexibility and the fresh ideas introduced in its design. It is very easy to modify and to add more sophisticated protocols, such as dynamic caching and erasure correcting codes.
user correction - Legacy Corrections
In Second International Workshop on Peer-to-Peer Systems