Distributed approaches to triangulation and embedding

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 640-649

  Slivkins, Aleksandrs ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DISTANCE MATRIX; EMBEDDING ALGORITHMS; INTERNET LATENCIES; NETWORK COMMUNITY;

ALGORITHMS; EMBEDDED SYSTEMS; INTERNET; MATRIX ALGEBRA; THEOREM PROVING; TRIANGULATION;

DISTRIBUTED PARAMETER CONTROL SYSTEMS;

EID: 20744458703     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (37)

1. n, " Bull. Soc. Math. France 111(4), pp. 429-448, 1983.
2. J. Bourgain. "On Lipschitz embeddings of finite metric spaces in Hilbert space," Israel J.Math, 52(1-2), pp. 46-52, 1985.
3. H.T-H. Chan, A. Gupta, B.M. Maggs and S. Zhou, "On hierarchical routing in bounded-growth metrics," in ACM-SIAM Symposium on Discrete Algorithms, 2005.
4. M. Costa, M. Castro, A. Rowstron and P. Key, "PIC: Practical Internet Coordinates for distance estimation," in International Conference on Distributed Computing Systems, 2004.
5. R. Cox, F. Dabek, F. Kaashoek and R. Morris, "Vivaldi: A decentralized network coordinate system," in ACM SIGCOMM, 2004.
6. G.M. Crippen and T.F. Havel, Distance geometry and molecular conformation, Wiley, 1988.
7. M. Fomenkov, k. daffy, B. Huffaker and D. Moore, "Macroscopic Internet topology and performance measurements from the DNS root name servers," Usenix LISA, 2001.
8. 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 Transactions on Networking, 2001.
9. C. Gavoille, D. Peleg, S. Perennes and R. Raz, "Distance Labeling in Graphs," in ACM-SIAM Symposium on Discrete Algorithms, 2000.
10. A.Gupta, R.Krauthgamer and J.R.Lee, "Bounded geometries, fractals and low-distortion embeddings," in IEEE Symposium on Foundations of Computer Science, 2003.
11. J. Guyton and M. Schwanz, "Locating nearby copies of replicated Internet servers," in ACM SIGCOMM, 1995.
12. J. Heinonen, Lectures on analysis on metric spaces. Springer Verlag, Universitext 2001.
13. K. Hildrum, J. Kubiatowicz, S. Rao and B. Zhao, "Distributed object location in a dynamic network," in ACM Symposium on Parallel Algorithms and Architectures, 2002.
14. K. Hildrum, J. Kubiatowicz, S. Ma and S. Rao, "A note on the nearest neighbor in growth-restricted metrics," in ACM-SIAM Symposium on Discrete Algorithms, 2004.
15. S. Hotz, "Routing information organization to support scalable interdomain routing with heterogeneous path requirements," Ph.D. Thesis, Univ. of Southern California, 1994.
16. B. Huffaker, M. Fomenkov, D.J. Plummer, D. Moore and k claffy, "Distance metrics in the Internet," IEEE International Telecommunications Symposium, 2002.
17. P. Indyk,"Algorithmic applications of low-distortion geometric embeddings," invited survey, in IEEE Symposium on Foundations of Computer Science, 1999.
18. D. Karger and M. Ruhl, "Finding nearest neighbors in growth-restricted metrics," in ACM Symposium on the Theory of Computing, 2002.
19. J.Kleinberg, A.Slivkins and T.Wexler, "Triangulation and embedding using small sets of beacons" in IEEE Symposium on Foundations of Computer Science, 2004.
20. C. Kommareddy, N. Shankar and B. Bhattacharjee, "Finding close friends on the Internet," in International Conference on Network Protocols, 2001.
21. D. Kostic, A. Rodriguez, J. Albrecht, A. Bhirud and A. Vahdat, "Using random subsets to build scalable network services," in USENIX Symposium on Internet Technologies and Systems, 2003.
22. R. Krauthgamer and J.R. Lee "Navigating nets: Simple algorithms for proximity search," in ACM-SIAM Symposium on Discrete Algorithms, 2004.
23. R. Krauthgamer, J.R. Lee, M. Mendel and A. Naor, "Measured descent: a new embedding method for finite metrics," in IEEE Symposium on Foundations of Compute r Science, 2004.
24. L. Lehman and S. Lerman, "PALM: Predicting Internet network distances using peer-to-peer measurements," MIT Electronic Tech Report, 2004.
25. N. Linial, E. London and Yu. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica (1995) 15, pp.215-245.
26. M. Mendel and S. Har-Peled, "Fast construction of nets in low dimensional metrics, and their applications," Manuscript, 2004.
27. E. Ng and H. Zhang, "Predicting internet network distance with coordinates-based approaches", in IEEE INFOCOM, 2002.
28. R. Percacci and A. Vespignani "Scale-free behavior of the Internet global performance," arXiv e-print cond-mat/0209619, September 2002.
29. M.Pias, J.Crowcroft, S.Wilbur, S.Bhatti, T.Harris "Light-houses for scalable distributed location," in International Workshop on Peer-to-Peer Systems, 2003.
30. B. Pittel, "On spreading a rumor," SIAM J. Applied Math, 47 (1987).
31. C.G. Plaxton, R. Rajaraman and A.W. Richa, "Accessing nearby copies of replicated objects in a distributed environment," in ACM Symposium on Parallel Algorithms and Architectures, 1997.
32. Dana Ron, "Property Testing", Survey 2000.
33. K. Talwar, "Bypassing the embedding: approximation schemes and compact representations for growth restricted metrics," in ACM Symposium on the Theory of Computing, 2004.
34. A. Vazquez, R. Pastor-Satorras and A. Vespignani, "Large-scale topological and dynamical properties of Internet," Phys. Rev. E 65, 066130 (2002).
35. V. Vishnumurthy and P. Francis, "On random node selection in P2P and overlay networks," manuscript, 2004.
36. B. Wong and E.G. Sirer, "A lightweight approach to network positioning," Cornell CS Electronic Tech Report, 2004.
37. B.Y. Zhao, L. Huang, S.C. Rhea, J. Stribling, A.D. Joseph and J.D. Kubiatowicz, "Tapestry: a resilient global-scale overlay for service deployment," IEEE J. on Selected Areas in Communications, 22(1), 2004.