Constructing internet coordinate system based on delay measurement
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Virtual landmarks for the internet
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
PIC: Practical Internet Coordinates for Distance Estimation
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
Measurement based analysis, modeling, and synthesis of the internet delay space
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Towards network triangle inequality violation aware distributed systems
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Distributed algorithms for stable and secure network coordinates
Proceedings of the 8th ACM SIGCOMM conference on Internet measurement
Triangle Inequality and Routing Policy Violations in the Internet
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
Phoenix: Towards an Accurate, Practical and Decentralized Network Coordinate System
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Detecting Triangle Inequality Violations in Internet Coordinate Systems by Supervised Learning
NETWORKING '09 Proceedings of the 8th International IFIP-TC 6 Networking Conference
Scalable Link-Based Relay Selection for Anonymous Routing
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Triangle inequality variations in the internet
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Fundamental effects of clustering on the Euclidean embedding of internet hosts
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
A cluster based approach for network distance embedding
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
On suitability of Euclidean embedding for host-based network coordinate systems
IEEE/ACM Transactions on Networking (TON)
Measurement-based analysis, modeling, and synthesis of the internet delay space
IEEE/ACM Transactions on Networking (TON)
Orion: shortest path estimation for large social graphs
WOSN'10 Proceedings of the 3rd conference on Online social networks
Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
An approach to peer selection in service overlays
Proceedings of the 7th International Conference on Network and Services Management
Network distance prediction based on decentralized matrix factorization
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
NCShield: securing decentralized, matrix factorization-based network coordinate systems
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Peer selection in p2p service overlays using geographical location criteria
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part II
Multimedia Tools and Applications
DMFSGD: a decentralized matrix factorization algorithm for network distance prediction
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
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.