Distance estimation and object location via rings of neighbors

Distributed Computing

Volumn 19, Issue 4, 2007, Pages 313-333

  Slivkins, Aleksandrs ^a  

^a Brown Univerity   (United States)

Author keywords

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

Indexed keywords

ALGORITHMS; COMPUTER SCIENCE; DATA STRUCTURES; DISTRIBUTED DATABASE SYSTEMS; INFORMATION ANALYSIS; PARAMETER ESTIMATION;

COMPUTER SCIENCE LITERATURE; DISTANCE ESTIMATION; GLOBAL INFORMATION; INFORMATIVE NODE LABELS;

PROBLEM SOLVING;

EID: 33847275060     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-006-0015-8     Document Type: Conference Paper

References (58)

1. Volberg, A.L., Konyagin, S.V.: On measures with the doubling condition. Izv. Acad. Nauk SSSR 51, 666-675 (1987) In Russian;
2. English transl. Math. USSR Izv. 30, 629-638 (1988)
3. Abraham, I., Bartal, Y., Chan, H.T.H., Dhamdhere, K., Gupta, A., Kleinberg, J., Neiman, O., Slivkins, A.: Metric embeddings with relaxed guarantees. In: 46th Symposium on Foundations of Computer Science (FOCS), pp. 83-100 (2005)
4. Abraham, I., Gavoille, C.: Object location using path separators. In: 25th Annual ACM SIGACT-SIGOPS Symp. on Principles Of Distributed Computing (PODC) (2006)
5. Abraham, I., Gavoille, C., Goldberg, A., Malkhi, D.: Routing in networks with low doubling dimension. In: 26th IEEE International Conference on Distributed Computing Systems (ICDCS) (2006)
6. Abraham, I., Gavoille, C., Malkhi, D.: Routing with improved communication-space trade-off. In: 18th Annual Conference on Distributed Computing (DISC), pp. 305-319 (2004)
7. Abraham, I., Gavoille, C., Malkhi, D.: Compact routing for graphs excluding a fixed minor. In: 19th Annual Conference on Distributed Computing (DISC), pp. 442-456 (2005)
8. Abraham, I., Gavoille, C., Malkhi, D., Nisan, N., Thorup, M.: Compact name-independent routing with minimum stretch. In: 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 20-24 (2004)
9. Abraham, I., Malkhi, D.: Compact routing on Euclidean metrics. In: 23rd Annual ACM SIGACT-SIGOPS Symp. on Principles Of Distributed Computing (PODC), pp. 141-149 (2004)
10. Abraham, I., Malkhi, D.: Name independent routing for growth bounded networks. In: 17th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 49-55 (2005)
11. Abraham, I., Malkhi, D., Dobzinski, O.: LAND: Stretch (1+ε) locality-aware networks for DHTs. In: 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 550-559 (2004)
12. n. Bull. Soc. Math. France 111(4), 429-448 (1983)
13. Awerbuch, B., Bar-Noy, A., Linial, N., Peleg, D.: Improved routing strategies with succinct tables. J. Algorithms 11(3), 307-341 (1990)
14. Awerbuch, B., Goldberg, A., Luby, M., Plotkin, S.: Network decomposition and locality in distributed computation. In: 30th Symposium on Foundations of Computer Science (FOCS), pp. 364-369 (1989)
15. Awerbuch, B., Peleg, D.: Sparse partitions. In: 31st Symposium on Foundations of Computer Science (FOCS), pp. 503-513 (1990)
16. Chan, H.T.H., Gupta, A., Maggs, B.M., Zhou, S.: On hierarchical routing in bounded-growth metrics. In: 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 762-771 (2005). Full and updated version available as a Carnegie Mellon University ETR CMU-PDL-04-106
17. Dodds, P.S., Muhamad, R., Watts, D.J.: An experimental study of search in global social networks. Science 301, 827-829 (2003)
18. Duchon, P., Hanusse, N., Lebhar, E., Schabanel, N.: Could any graph be turned into a small world? In: 19th Annual Conference on Distributed Computing (DISC), pp. 511-513 (2005). Full version to appear in Theoretical Computer Science, special issue on complex networks (2006)
19. Fraigniaud, P.: A new perspective on the small-world phenomenon: greedy routing in tree-decomposed graphs. In: 13th AnnualEuropean Symposium on Algorithms (ESA), pp. 791-802 (2005)
20. Fraigniaud, P., Gavoille, C., Paul, C.: Eclecticism shrinks even small worlds. In: 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles Of Distributed Computing (PODC), pp. 169-178 (2004)
21. Fraigniaud, P., Lebhar, E., Lotker, Z.: A doubling dimension threshold Θ (log log n) for augmented graph navigability. In: 14th Annual European Symposium on Algorithms (ESA) (2006)
22. Francis, P., Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: IDMaps: A global Internet host distance estimation service. IEEE ACM Trans. Netw. 9, 525-540 (2001). Preliminary version in IEEE INFOCOM 1999
23. Gavoille, C., Gengler, M.: Space-efficiency for routing Schemes of stretch factor three. J Parallel Distrib Comput 61(5), 679-687 (2001)
24. Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: 9th Annual European Symposium on Algorithms (ESA), pp. 476-487 (2001)
25. Gavoille, C., Peleg, D.: Compact and localized distributed data structures. J. Distrib. Comput. 16, 111-120 (2003)
26. Gavoille, C., Peleg, D., Perennes, S., Raz, R.: Distance labeling in graphs. J. Algorithms 53(1), 85-112 (2004). (Preliminary version in 12th ACM-SIAM SODA, 2001)
27. Gupta, A., Krauthgamer, R., Lee, J.R.: Bounded geometries, fractals, and low-distortion embeddings. In: 44th Symposium on Foundations of Computer Science (FOCS), pp. 534-543 (2003)
28. Guyton, J., Schwartz, M.: Locating nearby copies of replicated Internet servers. In: ACM SIGCOMM (1995)
29. Hildrum, K., Kubiatowicz, J., Rao, S.: Object location in realistic networks. In: 16th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 25-35 (2004)
30. Hotz, S.M.: Routing information organization to support scalable interdomain routing with heterogeneous path requirements. Ph.D. Thesis, University of Southern California (1994)
31. Kleinberg, J.: Navigation in a small world. Nature 406, 485 (2000)
32. Kleinberg, J.: The small-world phenomenon: an algorithmic perspective. In: 32nd ACM Symposium on Theory of Computing (STOC), pp. 163-170 (2000)
33. Kleinberg, J.: Small-world phenomena and the dynamics of information. In: 15th Advances in Neural Information Processing Systems (NIPS), pp. 431-438 (2001)
34. Kleinberg, J.: Complex networks and decentralized search algorithms. In: International Congress of Mathematicians (2006)
35. Kleinberg, J., Slivkins, A., Wexler, T.: Triangulation and Embedding Using Small Sets of Beacons. In: 45th Symposium on Foundations of Computer Science (FOCS), pp. 444-453 (2004)
36. Kommareddy, C., Shankar, N., Bhattacharjee, B.: Finding close friends on the Internet. In: 12th IEEE International Conference on Network Protocols (ICNP) (2001)
37. Krauthgamer, R., Lee, J., Mendel, M., Naor, A.: Measured descent: A new embedding method for finite metrics. Geometric and Functional Analysis (GAF'A) 15(4), 839-858 (2005). Preliminary version in 45th IEEE FOCS (2004)
38. Krauthgamer, R., Lee, J.R.: Navigating nets: simple algorithms for proximity search. In: 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 798-807 (2004)
39. Lebhar, E., Schabanel, N.: Close to optimal decentralized routing in long-range contact networks. In: 31st International Colloquium on Automata, Languages and Programming (ICALP), pp. 894-905 (2004)
40. Luukkainen, J., Saksman, E.: Every complete doubling metric space carries a doubling measure. Proc. Am. Math. Soc. 126(2), 531-534 (1998)
41. Manku, G., Bawa, M., Raghavan, P.: Symphony: distributed hashing in a small world. In: 4th USENIX Symposium on Internet Technologies and Systems (USITS) (2003)
42. Manku, G., Naor, M., Wieder, U.: Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks. In: 36th ACM Symposium on Theory of Computing (STOC), pp. 54-63 (2004)
43. Martel, C., Nguyen, V.: Analyzing Kleinberg's (and other) small-world models. In: 23rd Annual ACM SIGACT-SIGOPS Symposium on Principles Of Distributed Computing (PODC), pp. 179-188 (2004)
44. Martel, C., Nguyen, V.: Analyzing and characterizing small-world graphs. In: 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 311-320 (2005)
45. Mendel, M., Har-Peled, S.: Fast construction of nets in low dimensional metrics, and their applications. In: 21st ACM Symposium on Computational Geometry (SoCG), pp. 150-158 (2005)
46. Milgram, S.: The small world problem. Psychol Today 2, 60-67 (1967)
47. Peleg, D.: Proximity-preserving labeling schemes and their applications. In: The 25th International Workshop on Graph-Theoretical Concepts in Computer Science (LNCS 1665), pp. 30-41 (1999)
48. Peleg, D.: Distributed computing: a locality-sensitive approach. SIAM (2000)
49. Peleg, D., Upfal, E.: A trade-off between space and effciency for routing tables. J. ACM 36(3), 510-530 (1989). (Preliminary version in 20th ACM STOC, 1988)
50. Plaxton, C.G., Rajaraman, R., Richa, A.W.: Accessing nearby copies of replicated objects in a distributed environment. Theory Comput. Syst. 32(3), 241-280 (1999). Preliminary version in 9th ACM SPAA (1997)
51. Slivkins, A.: Distributed Approaches to Triangulation and Embedding. In: 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 640-649 (2005)
52. Slivkins, A.: Distance estimation and object location via rings of neighbors. Technical Report cul.cis/TR2005-1977, Cornell University Computing and Information Science (2006). Available online at http://techreports.library. cornell.edu
53. Talwar, K.: Bypassing the embedding: approximation schemes and compact representations for growth restricted metrics. In: 36th ACM Symposium on Theory of Computing (STOC), pp. 281-290 (2004)
54. Thorup, M., Zwick, U.: Compact routing schemes. In: 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 1-10 (2001)
55. Thorup, M., Zwick, U.: Approximate distance oracles. J. ACM 52(1), 1-24 (2005) (Preliminary version in 33rd ACM STOC, 2001)
56. Watts, D.J., Strogatz, S.H.: Collective dynamics of 'small-world' networks. Nature 393, 440-442 (1998)
57. Wong, B., Slivkins, A., Sirer, E.G.: Meridian: A Lightweight Network Location Service without Virtual Coordinates. In: ACM SIGCOMM (2005)
58. Wu, J.M.: Hausdorff dimension and doubling measures on metric spaces. Proc. Am. Math. Soc. 126(5), 1453-1459 (1998)