On suitability of Euclidean embedding of internet hosts

ABSTRACT

In this paper, we investigate the suitability of embedding Internet hosts into a Euclidean space given their pairwise distances (as measured by round-trip time). Using the classical scaling and matrix perturbation theories, we first establish the (sum of the) magnitude of negative eigenvalues of the (doubly-centered, squared) distance matrix as a measure of suitability of Euclidean embedding. We then show that the distance matrix among Internet hosts contains negative eigenvalues of large magnitude, implying that embedding the Internet hosts in a Euclidean space would incur relatively large errors. Motivated by earlier studies, we demonstrate that the inaccuracy of Euclidean embedding is caused by a large degree of triangle inequality violation (TIV) in the Internet distances, which leads to negative eigenvalues of large magnitude. Moreover, we show that the TIVs are likely to occur locally, hence, the distances among these close-by hosts cannot be estimated accurately using a global Euclidean embedding, in addition, increasing the dimension of embedding does not reduce the embedding errors. Based on these insights, we propose a new hybrid model for embedding the network nodes using only a 2-dimensional Euclidean coordinate system and small error adjustment terms. We show that the accuracy of the proposed embedding technique is as good as, if not better, than that of a 7-dimensional Euclidean embedding.

REFERENCES

• 1: T. S. Eugene Ng and Hui Zhang. Predicting Internet network distance with coordinates-based approaches. In Proc. IEEE INFOCOM New York, NY, June 2002.
• 2: Liying Tang , Mark Crovella, Virtual landmarks for the internet, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, October 27-29, 2003, Miami Beach, FL, USA [doi>10.1145/948205.948223]
• 3: Hyuk Lim , Jennifer C. Hou , Chong-Ho Choi, Constructing internet coordinate system based on delay measurement, Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement, October 27-29, 2003, Miami Beach, FL, USA [doi>10.1145/948205.948222]
• 4: Frank Dabek , Russ Cox , Frans Kaashoek , Robert Morris, Vivaldi: a decentralized network coordinate system, Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, August 30-September 03, 2004, Portland, Oregon, USA
• 5: Manuel Costa , Miguel Castro , Antony Rowstron , Peter Key, PIC: Practical Internet Coordinates for Distance Estimation, Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04), p.178-187, March 24-26, 2004
• 6: Han Zheng, Eng Keong Lua, Marcelo Pias, and Timothy G. Griffin. Internet routing policies and round-trip-times. In The 6th anuual Passive and Active Measurement Workshop Boston, MA, March 2005.
• 7: Eng Keong Lua, Timothy Gri . n, Marcelo Pias, Han Zheng, and Jon Crowcroft. On the accuracy of embeddings for internet coordinate systems. In Proceedings of the Internet Measurement Conference (IMC) Boston, MA, April 2005.
• 8: Meridian:A lightweight network location service without virtual coordinates. Philadelphia, PA, August 2005.
• 9: Ingwer Borg and Patrick Groenen. Modern Multidimensional Scaling: Theory and Applications Springer, 1997.
• 10: Gene H. Gulub and Charles F. van Loan. Matrix Computation the John Hopkins University Press, 3rd edition, 1996.
• 11: King462 data set. http://pdos.lcs.mit.edu/p2psim/kingdata.
• 12: King2305 data set. http://www.cs.cornell.edu/People/egs/meridian/data.php.
• 13: Jeremy Stribling. Rtt among planetlab nodes. http://www.pdos.lcs.mit.edu/strib/plapp/.
• 14: Global nework positioning (gnp). http://www-2.cs.cmu.edu/eugeneng/research/gnp/.
• 15: Andrew Y. Ng, Michael I. Jordan, and Yair Weiss. On spectral clustering: Analysis and an algorithm. Advances in Neural Information Processing Systems (NIPS) 14, 2002.
• 16: Douglas B. West. Introduction to Graph Theory Prentice Hall., second edition, 2001.

INDEX TERMS

Primary Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS
      C.2.1 Network Architecture and Design

General Terms:
Algorithms, Measurement, Performance

Keywords:
Euclidean embedding, suitability, triangle inequality