Algorithms for clustering data
Algorithms for clustering data
Introduction to algorithms
Locating nearby copies of replicated Internet servers
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
End-to-end routing behavior in the Internet
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Adaptive dimension reduction for clustering high dimensional data
ICDM '02 Proceedings of the 2002 IEEE International Conference on Data Mining
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
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A coordinate-based approach for exploiting temporal-spatial diversity in wireless mesh networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Broker-placement in latency-aware peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Offering data confidentiality for multimedia overlay multicast: Design and analysis
ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP)
An adaptive latency mitigation scheme for massively multiuser virtual environments
Journal of Network and Computer Applications
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
DCS: A Distributed Coordinate System for Network Positioning
DS-RT '09 Proceedings of the 2009 13th IEEE/ACM International Symposium on Distributed Simulation and Real Time Applications
Dynamic landmark triangles: A simple and efficient mechanism for inter-host latency estimation
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we consider the problem of how to represent the locations of Internet hosts in a Cartesian coordinate system to facilitate estimation of network distances among arbitrary Internet hosts. We envision an infrastructure that consists of beacon nodes and provides the service of estimating network distance between pairs of hosts without direct delay measurement. We show that the principal component analysis (PCA) technique can effectively extract topological information from delay measurements between beacon hosts. Based on PCA, we devise a transformation method that projects the raw distance space into a new coordinate system of (much) smaller dimensions. The transformation retains as much topological information as possible and yet enables end hosts to determine their coordinates in the coordinate system. The resulting new coordinate system is termed as the Internet Coordinate System (ICS). As compared to existing work (e.g., IDMaps and GNP), ICS incurs smaller computation overhead in calculating the coordinates of hosts and smaller measurement overhead (required for end hosts to measure their distances to beacon hosts). Finally, we show via experiments with both real-life and synthetic data sets that ICS makes robust and accurate estimates of network distances, incurs little computational overhead, and its performance is not susceptible to the number of beacon nodes (as long as it exceeds a certain threshold) and the network topology.