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.
- T. S. Eugene Ng and Hui Zhang. Predicting Internet network distance with coordinates-based approaches. In Proc. IEEE INFOCOM New York, NY, June 2002.Google Scholar
- Liying Tang and Mark Crovella. Virtual landmarks for the Internet. In Proceedings of the Internet Measurement Conference (IMC) Miami, Florida, October 2003. Google ScholarDigital Library
- Hyuk Lim, Jennifer C. Hou, and Chong-Ho Choi. Constructing Internet coordinate system based on delay measurement. In Proceedings of the Internet Measurement Conference (IMC) Miami, Florida, October 2003. Google ScholarDigital Library
- Frank Dabek, Russ Cox, Frans Kaashoek, and Robert Morris. Vivaldi:A decentralized network coordinate system. In Proceedings of ACM SIGCOMM 2004 Portland, OR, August 2004. Google ScholarDigital Library
- Manuel Costa, Miguel Castro, Antony Rowstron, and Peter Key. Pic:Practical Internet coordinates for distance estimation. In Proceedings of International Conference on Distributed Computing Systems (ICDCS) Tokyo, Japan, March 2004. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- 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. Google ScholarDigital Library
- Meridian:A lightweight network location service without virtual coordinates. Philadelphia, PA, August 2005.Google Scholar
- Ingwer Borg and Patrick Groenen. Modern Multidimensional Scaling: Theory and Applications Springer, 1997.Google Scholar
- Gene H. Gulub and Charles F. van Loan. Matrix Computation the John Hopkins University Press, 3rd edition, 1996.Google Scholar
- King462 data set. http://pdos.lcs.mit.edu/p2psim/kingdata.Google Scholar
- King2305 data set. http://www.cs.cornell.edu/People/egs/meridian/data.php.Google Scholar
- Jeremy Stribling. Rtt among planetlab nodes. http://www.pdos.lcs.mit.edu/strib/plapp/.Google Scholar
- Global nework positioning (gnp). http://www-2.cs.cmu.edu/eugeneng/research/gnp/.Google Scholar
- 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.Google Scholar
- Douglas B. West. Introduction to Graph Theory Prentice Hall., second edition, 2001.Google Scholar
Index Terms
- On suitability of Euclidean embedding of internet hosts
Recommendations
On suitability of Euclidean embedding of internet hosts
SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systemsIn 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 ...
On suitability of Euclidean embedding for host-based network coordinate systems
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 ...
The least Euclidean distortion constant of a distance-regular graph
AbstractIn 2008, Vallentin made a conjecture involving the least distortion of an embedding of a distance-regular graph into Euclidean space. Vallentin’s conjecture implies that for a least distortion Euclidean embedding of a distance-regular ...
Comments