Triangulation and embedding using small sets of beacons

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2004, Pages 444-453

  Kleinberg, Jon ^a   Slivkins, Aleksandrs ^a   Wexler, Tom ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

BEACON-BASED ALGORITHMS; COMPUTER NODES; DOUBLING DIMENSIONS; MULTIPLICATIVE ERRORS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DISTANCE MEASUREMENT; DISTRIBUTED COMPUTER SYSTEMS; INTERNET; MATRIX ALGEBRA; OPTIMIZATION; THEOREM PROVING; TRIANGULATION;

EMBEDDED SYSTEMS;

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

References (35)

1. n, " Bull. Soc. Math. France 111(4), pp. 429-448, 1983.
2. Y. Bartal, N. Linial, M. Mendel and A. Naor, "On Metric Ramsey-Type Phenomena," in 35th Annual ACM Symposium on the Theory of Computing, 2003.
3. J. Bourgain, "On Lipschitz embeddings of finite metric spaces in Hilbert space," Israel J. of Math, 52(1-2), pp. 46-52, 1985.
4. R. Cox, F. Dabek, F. Kaahoek, J. Li and R. Morris, "Practical, Distributed Network Coordinates," HotNets 2003.
5. G.M. Crippen and T.F. Havel, Distance Geometry and Molecular Conformation, Wiley, 1988.
6. R. Cox and F. Dabek, "Learning Euclidean coordinates for Internet hosts," MIT ETR 2003.
7. M. Fomenkov, k claffy, B. Huffaker, 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, R. Raz "Distance Labeling in Graphs," In 11th ACM-SIAM Symposium on Discrete Algorithms, 2000.
10. O. Goldreich, S. Goldwasser and D. Ron, "Property Testing and its Connection to Learning and Approximation", in 37th Annual IEEE Symposium on Foundations of Computer Science, 1996.
11. K.P. Gummadi, S. Saroiu and S.D. Gribble, "King: Estimating Latency between Arbitrary Internet End Hosts," ACM SIGCOMM IMW 2002.
12. A.Gupta, R. Krauthgamer and J.R. Lee, "Bounded Geometries, Fractals, and Low-Distortion Embeddings," in 44th Annual IEEE Symposium on Foundations of Computer Science, 2003.
13. J.D. Guyton and M.F. Schwartz, "Locating Nearby Copies of Replicated Internet Servers," ACM SIGCOMM 1995.
14. B. Huffaker, M. Fomenkov, D.J. Plummer, D. Moore and k claffy, "Distance Metrics in the Internet," IEEE International Telecommunications Symposium, 2002.
15. P. Indyk, "Algorithmic applications of low-distortion geometric embeddings," survey, in 40th IEEE Symposium on Foundations of Computer Science, 1999.
16. P. Indyk. "Sublinear Time Algorithms for Metric Space Problems," in 40th Annual IEEE Symposium on Foundations of Computer Science, 1999.
17. n," Acta Mathematica, 149, pp. 71-85, 1982.
18. D. Karger and M. Ruhl, "Finding Nearest Neighbors in Growth-restricted Metrics," in 34th Annual ACM Symposium on the Theory of Computing, 2002.
19. R. Krauthgamer and J.R. Lee "The Intrinsic Dimensionality of Graphs," in 35th Annual ACM Symposium on the Theory of Computing, 2003.
20. R. Krauthgamer and J.R. Lee "Navigating nets: Simple algorithms for proximity search," In 15th ACMSIAM Symposium on Discrete Algorithms, 2004.
21. R. Krauthgamer and O. Sasson, "Property testing of data dimensionality," In 14th ACM-SIAM Symposium on Discrete Algorithms, 2003.
22. C. Kommareddy, N. Shankar and B. Bhattacharjee, "Finding close friends on the Internet," ICNP 2001.
23. N. Linial, "Finite metric spaces - combinatorics, geometry and algorithms," Proc. International Congress of Mathematicians III, pp. 573-586 Beijing, 2002
24. N. Linial, E. London and Yu. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Combinatorica (1995) 15, pp. 215-245.
25. p spaces," Israel J. of Mathematics 102 (1997).
26. J. Matousek and P. Indyk, survey, in Handbook of Discrete and Computational Geometry, J.E. Goodman and J. O'Rourke, eds, CRC Press LLC, FL 1997.
27. E. Ng and H. Zhang, "Predicting Internet Network Distance with Coordinates-Based Approaches", IEEE INFOCOM 2002.
28. R. Percacci and A. Vespignani "Scale-free behavior of the Internet global performance," arXiv e-print condmat/0209619, September 2002.
29. M. Pias, J. Crowcroft, S. Wilbur, S. Bhatti and T. Harris "Lighthouses for Scalable Distributed Location," In 2nd International Workshop on P2P Systems, 2003.
30. D. Ron and M. Parnas, "Testing Metric Properties," in 33th Annual ACM Symposium on the Theory of Computing, 2001.
31. ∞ weights," Rev. Mat. Iberoamericana 12 (1996).
32. K. Talwar, "Bypassing the embedding: Approximation schemes and Compact Representations for growth restricted metrics," in 36th Annual ACM Symposium on the Theory of Computing, 2004.
33. T. Tankel and Y. Shavitt, "Big-bang simulation for embedding network distances in Euclidean space," IEEE INFOCOM 2003.
34. A. Vazquez, R. Pastor-Satorras and A. Vespignani, "Large-scale topological and dynamical properties of Internet," Phys. Rev. E 65, 066130 (2002).
35. B.Y. Zhao, J.D. Kubiatowicz, A.D. Joseph. "Tapestry: An Infrastructure for Fault-Tolerant Wide-Area Location and Routing," UC Berkeley CS Division, Report No. UCB/CSD 01/1141, April 2001.