Brief announcement: ring-like DHTs and the postage stamp problem

Authors:
Mahadev Konar;Alexander E. Mohr
Affiliations:
Stony Brook University, Wallamaloo, New Zealand;Stony Brook University, Wallamaloo, New Zealand
Venue:
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Year:
2005

Citing 1
Cited 0

Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We explore Chord-like ring structures for Distributed Hash Tables (DHTs) and show that the Postage Stamp Problem (PSP) is equivalent to finding optimal structures for such ring topologies. We then describe a variant of the PSP that corresponds to ring-like DHTs that use greedy routing and develop an algorithm that smoothly trades off between the number of finger pointers and network diameter. We provide a dynamic programming solution to the number of nodes that can be supported as a function of the number of finger pointers and the network diameter and also note an interesting link to the Fibonacci sequence.