Spacefilling curves and the planar travelling salesman problem
Journal of the ACM (JACM)
Accessing nearby copies of replicated objects in a distributed environment
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
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
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On Multi-dimensional Hilbert Indexings
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
LAND: stretch (1 + ε) locality-aware networks for DHTs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
One torus to rule them all: multi-dimensional queries in P2P systems
Proceedings of the 7th International Workshop on the Web and Databases: colocated with ACM SIGMOD/PODS 2004
Approximating TSP on metrics with bounded global growth
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
We present fully distributed algorithms for random sampling of nodes in peer-to-peer systems, extending and generalizing the work of King and Saia [Proceedings of PODC 2004] from simple Chord-like distributed hash tables to systems based on higher-dimensional hierarchical constructions, like Content Addressable Networks (CAN). We also show preliminary results on the generalization of the problem to biased sampling. In addition, we provide an extension of CAN that requires only O(1) space per node and achieves O(log n) lookup latency and message complexities.