On suitability of euclidean embedding for host-based network coordinate systems

IEEE/ACM Transactions on Networking

Volumn 18, Issue 1, 2010, Pages 27-40

  Lee, Sanghwan ^a   Zhang, Zhi Li ^b   Sahu, Sambit ^c   Saha, Debanjan ^c  

^a Kookmin University   (South Korea)

^b University of Minnesota   (United States)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Euclidean embedding; Suitability; Triangle inequality

Indexed keywords

CLASSICAL SCALING; DISTANCE MATRICES; EIGENVALUES; EMBEDDING TECHNIQUE; ERROR ADJUSTMENT; EUCLIDEAN; EUCLIDEAN COORDINATES; EUCLIDEAN SPACES; HOST-BASED; HYBRID MODEL; INTERNET HOSTS; MATRIX PERTURBATION THEORY; NETWORK COORDINATES; NETWORK NODE; PAIRWISE DISTANCES; ROUND-TRIP TIME; TRIANGLE INEQUALITY;

COORDINATE MEASURING MACHINES; EIGENVALUES AND EIGENFUNCTIONS; ERRORS; GEOMETRY; INTERNET;

PERTURBATION TECHNIQUES;

EID: 77249105918     PISSN: 10636692     EISSN: None     Source Type: Journal    
DOI: 10.1109/TNET.2009.2023322     Document Type: Article

References (15)

1. S. Lee, Z.-L. Zhang, S. Sahu, and D. Saha, "On suitability of Euclidean embedding of Internet hosts," in Proc. ACM SIGMETRICS, Saint Malo, France, Jun. 2006, pp. 157-168.
2. T. E. Ng and H. Zhang, "Predicting Internet network distance with coordinates-based approaches," in Proc. IEEE INFOCOM, New York, Jun. 2002, pp. 170-179.
3. L. Tang and M. Crovella, "Virtual landmarks for the Internet," in Proc. IMC, Miami, FL, Oct. 2003, pp. 143-152.
4. H. Lim, J. C. Hou, and C.-H. Choi, "Constructing Internet coordinate system based on delay measurement," in Proc. IMC, Miami, FL, Oct. 2003, pp. 129-142.
5. F. Dabek, R. Cox, F. Kaashoek, and R. Morris, "Vivaldi: A decentralized network coordinate system," in Proc. ACM SIGCOMM, Portland, OR, Aug. 2004, pp. 15-26.
6. M. Costa, M. Castro, A. Rowstron, and P. Key, "Pic: Practical Internet coordinates for distance estimation," in Proc. ICDCS, Tokyo, Japan, Mar. 2004, pp. 178-187.
7. H. Zheng, E. K. Lua, M. Pias, and T. G. Griffin, "Internet routing policies and round-trip-times," in Proc. 6th Annu. Passive Active Meas. Workshop, Boston, MA, Mar. 2005, pp. 236-250.
8. E. K. Lua, T. Griffin, M. Pias, H. Zheng, and J. Crowcroft, "On the accuracy of embeddings for Internet coordinate systems," in Proc. IMC, Boston, MA, Apr. 2005.
9. B. Wong, A. Slivkins, and E. G. Sirer, "Meridian: A lightweight network location service without virtual coordinates," in Proc. ACM SIG-COMM, Philadelphia, PA, Aug. 2005, pp. 85-96.
10. I. Borg and P. Groenen, Modern Multidimensional Scaling: Theory and Applications. New York: Springer, 1997.
11. G. H. Gulub and C. F. van Loan, Matrix Computation, 3rd ed. Baltimore, MD: Johns Hopkins Univ. Press, 1996.
12. King2305 data set, [Online. Available: http://www.cs.cor-nell.edu/People/ egs/meridian/data.php
13. A. Gupta, "Embedding tree metrics into low-dimensional Euclidean spaces," Discrete Comput. Geom., vol.24, no.1, pp. 105-116, May 2000.
14. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," Adv. Neural Inf. Process. Syst., vol.14, pp. 849-856, 2001.
15. D. B. West, Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2001.