Distance estimation and object location via rings of neighbors

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 24, Issue , 2005, Pages 41-50

  Slivkins, Aleksandrs ^a  

^a Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Distance labeling; Doubling dimension; Doubling metrics; Routing schemes; Small world networks; Triangulation

Indexed keywords

DISTANCE ESTIMATION; DISTANCE LABELING; DOUBLING METRICS; ROUTING SCHEMES;

COMPUTER SCIENCE; DATA STRUCTURES;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 23844472102     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073814.1073823     Document Type: Conference Paper

References (45)

1. I. Abraham, D. Malkhi, and O. Dobzinski, "LAND: Stretch (1 + ε) locality-aware networks for DHTs," in ACM-SIAM Symp. on Discrete Algorithms, 2004.
2. I. Abraham and D. Malkhi, "Compact routing on Euclidean metrics," in Annual SIGACT-SIGOPS Symp. on Principles Of Distributed Computing, 2004.
3. I. Abraham, C. Gavoille, D. Malkhi, N. Nisan and M. Thorup, " Compact Name-Independent Routing with Minimum Stretch," in ACM Symp. on Parallel Algorithms and Architectures, 2004.
4. I. Abraham, C. Gavoille and D. Malkhi Routing with Improved Communication-Space Trade-Off, in Annual Conference on Distributed Computing, 2004
5. I. Abraham and D. Malkhi, "Name independent routing for growth bounded networks," in ACM Symp. on Parallel Algorithms and Architectures, 2005.
6. n," Bull. Soc. Math. Prance, 111(4), pp. 429-448, 1983.
7. B. Awerbuch, A. Bar-Noy, N. Linial and D. Peleg, "Improved routing strategies with succinct tables," J. of Algorithms, 11(3), pp. 307-341, 1990.
8. B. Awerbuch and D. Peleg, "Sparse partitions," in Annual IEEE Symp. on Foundations of Computer Science, 1990.
9. H.T-H. Chan, A. Gupta, B.M. Maggs and S. Zhou, "On hierarchical routing in bounded-growth metrics," in ACM-SIAM Symp. on Discrete Algorithms, 2005. Full and updated version available as a Carnegie Mellon University Technical Report CMU-PDL-04-106, 2004.
10. P. Dodds, R. Muhamad and D. Watts, "An experimental study of search in global social networks," Science, 301: 827-829, 2003.
11. P. Fraigniaud, C. Gavoille and C. Paul, "Eclecticism shrinks even small worlds," in Annual SIGACT-SIGOPS Symp. on Principles Of Distributed Computing, 2004.
12. P. Francis, S. Jamin, C. Jin, Y. Jin, D. Raz, Y. Shavitt and L. Zhang, "IDMaps: a global Internet host distance estimation service," IEEE/ ACM Trans. on Networking, 2001.
13. C. Gavoille and M. Gengler, "Space-efficiency for routing schemes of stretch factor three," Journal of Parallel and Distributed Computing, 61(5):679687, 2001.
14. C. Gavoille, D. Peleg, S. Perennes and R. Raz, "Distance labeling in graphs," in ACM-SIAM Symp. on Discrete Algorithms, 2001. Also in J. of Algorithms, 53(1), pp. 85-112, 2004.
15. C. Gavoille, M. Katz, N.A. Katz, C. Paul and D. Peleg, "Approximate Distance Labeling Schemes," in Annual European Symp. on Algorithms, 2001
16. C. Gavoille and D. Peleg, "Compact and localized distributed data structures," J. Distrib. Comput., 16, 2003.
17. J. Heinonen, Lectures on analysis on metric spaces, Springer Verlag, Universitext 2001.
18. K. Hildrum, J. Kubiatowicz and S. Rao, "Object location in realistic networks," in ACM Symp. on Parallel Algorithms and Architectures, 2004.
19. S. Hotz, "Routing information organization to support scalable interdomain routing with heterogeneous path requirements," Ph.D. Thesis, Univ. of Southern California, 1994.
20. J.D. Guyton, M.F. Schwartz, "Locating nearby copies of replicated Internet servers," in ACM SIGCOMM, 1995.
21. A.Gupta, R. Krauthgamer and J.R. Lee, "Bounded geometries, fractals, and low-distortion embeddings," in Annual IEEE Symp. on Foundations of Computer Science, 2003.
22. J. Kleinberg, "The small-world phenomenon: an algorithmic perspective," in Annual ACM Symp. on the Theory of Computing, 2000.
23. J. Kleinberg, " Small-world phenomena and the dynamics of information," in Advances in Neural Information Processing Systems, 2001.
24. J. Kleinberg, A. Slivkins and T. Wexler, "Triangulation and embedding using small sets of beacons," in Annual IEEE Symp. on Foundations of Computer Science, 2004.
25. C. Kommareddy, N. Shankar, B. Bhattacharjee, "Finding close friends on the Internet," in International Conference on Network Protocols, 2001.
26. R. Krauthgamer, J.R. Lee "Navigating nets: Simple algorithms for proximity search," in ACM-SIAM Symp. on Discrete Algorithms, 2004.
27. R. Krauthgamer, J.R. Lee, M. Mendel and A. Naor, "Measured descent: A new embedding method for finite metrics," in Annual IEEE Symp. on Foundations of Computer Science, 2004.
28. 1: Dimension, snowflakes, and average distortion," in Latin-American Conference on Combinatorics, Graphs and Applications, 2004.
29. D. Malkhi, personal communication, 2005.
30. G. Manku, M. Naor and U. Wieder, "Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks," in Annual ACM Symp. on the Theory of Computing, 2004.
31. Ch. Martel and V. Nguyen, "Analyzing Kleinberg's (and other) small-world models," in Annual SIGACT-SIGOPS Symp. on Principles Of Distributed Computing, 2004.
32. Ch. Martel and V. Nguyen, "Analyzing and characterizing small-world graphs," in ACM-SIAM Symp. on Discrete Algorithms, 2005.
33. M. Mendel and S. Har-Peled, "Fast construction of nets in low dimensional metrics, and their applications," in Annual ACM Symp. on Computational Geometry, 2005.
34. S. Milgram, "The small world problem," Psychology Today, 1, 61 (1967).
35. D. Peleg, "Proximity-Preserving Labeling Schemes and Their Applications," The 25th Int. Workshop on Graph-Theoretical Concepts in Computer Science, 1999 (LNCS 1665).
36. D. Peleg, Distributed computing: a locality-sensitive approach, SIAM, 2000.
37. D. Peleg and E. Upfal, "A trade-off between space and effciency for routing tables," in Annual ACM Symp. on the Theory of Computing, 1988. Also in J. ACM, 36(3):510-530, 1989.
38. C.G. Plaxton, R. Rajaraman and A. W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," Theory Comput. Syst., 32(3), pp. 241-280, 1999.
39. A. Slivkins, "Distributed approaches to triangulation and embedding," in ACM-SIAM Symp. on Discrete Algorithms, 2005.
40. A. Slivkins, " Distance Estimation and Object Location via Rings of Neighbors," full version: invited to the special issue of Distributed Computing, available from the author's webpage at www.cs.cornell.edu/people/slivkins/research.
41. K. Talwar, "Bypassing the embedding: approximation schemes and compact representations for growth restricted metrics," in Annual ACM Symp. on the Theory of Computing, 2004.
42. M. Thorup and U. Zwick, "Approximate distance oracles," in Annual ACM Symp. on the Theory of Computing, 2001.
43. M. Thorup and U. Zwick, "Compact routing schemes, in ACM Symp. on Parallel Algorithms and Architectures, 2001.
44. D.J. Watts, S.H. Strogatz, "Collective dynamics of 'small-world' networks," Nature, 393:440-42, 1998.
45. B. Wong, A. Slivkins and E.G. Sirer, "Meridian: A Lightweight Network Location Service without Virtual Coordinates," in ACM SIGCOMM, 2005.