Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abraham, I., Malkhi, D., Dobzinski, O.: LAND: Stretch (1 + ε) Locality Aware Networks for DHTs. In: ACM-SIAM SODA (2004)
Alber, J., Niedermeier, R.: On Multi-Dimensional Hilbert Indexings. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 329–339. Springer, Heidelberg (1998)
Platzmann, L.K., Bartholdi, J.J.: Spacefilling curves and the planar travelling salesman problem. Journal of the ACM 36(4), 719–737 (1989)
Ganesan, P., Yang, B., Garcia-Molina, H.: One torus to rule them all: multidimensional queries in P2P systems. In: 7th WebDB (2004)
Hilbert, D.: Ăœber stetige Abbildung einer Linie auf ein Flachenstuck. Math. Annln. 38, 459–460 (1891)
King, V., Saia, J.: Choosing a random peer. In: Proc. of the ACM PODC (2004)
Peano, G.: Sur une courbe qui remplit toute une aire plane. Math. Annln. 36, 157–160 (1890)
Plaxton, C., Rajaraman, R., Richa, A.: Accessing nearby copies of replicated objects in a distributed environment. In: Proc. of the ACM SPAA (1997)
Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable contentaddressable network. In: Proc. of the ACM SIGCOMM (2001)
Sagan, H.: Space-filling curves. Springer, Heidelberg (1994)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: ACM SIGCOMM (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Konjevod, G., Richa, A.W., Xia, D. (2006). On Sampling in Higher-Dimensional Peer-to-Peer Systems. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_59
Download citation
DOI: https://doi.org/10.1007/11682462_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)