On sampling in higher-dimensional peer-to-peer systems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3887 LNCS, Issue , 2006, Pages 641-652

  Konjevod, Goran ^a   Richa, Andréa W ^a   Xia, Donglin ^a  

^a Arizona State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SAMPLING;

CONTENT ADDRESSABLE NETWORKS (CAN); MESSAGE COMPLEXITIES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33745612444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11682462_59     Document Type: Conference Paper

References (11)

1. I. Abraham, D. Malkhi, O. Dobzinski: LAND: Stretch (1 + ε) Locality Aware Networks for DHTs. In ACM-SIAM SODA, 2004.
2. J. Alber, R. Niedermeier: On Multi-Dimensional Hilbert Indexings. In 4th COCOON, 1998.
3. L. K. Platzmann, J. J. Bartholdi: Spacefilling curves and the planar travelling salesman problem. In Journal of the ACM, 36(4):719-737, Oct 1989.
4. P. Ganesan, B. Yang, H. Garcia-Molina: One torus to rule them all: multi-dimensional queries in P2P systems. In 7th WebDB, 2004.
5. D. Hilbert: Über stetige Abbildung einer Linie auf ein Flachenstuck. Math. Annln., 38:459-460, 1891.
6. V. King, J. Saia: Choosing a random peer. In Proc. of the ACM PODC, 2004.
7. G. Peano: Sur une courbe qui remplit toute une aire plane. Math. Annln., 36:157-160, 1890.
8. C. Plaxton, R. Rajaraman, A. Richa: Accessing nearby copies of replicated objects in a distributed environment. In Proc. of the ACM SPAA, 1997.
9. S. Ratnasamy, P. Francis, M. Handley, R. Karp, S. Schenker: A scalable content-addressable network. In Proc. of the ACM SIGCOMM, 2001.
10. H. Sagan: Space-filling curves, Springer Verlag 1994.
11. I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In ACM SIGCOMM, 2001.