Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
King: estimating latency between arbitrary internet end hosts
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
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
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
On suitability of Euclidean embedding of internet hosts
SIGMETRICS '06/Performance '06 Proceedings of the joint international conference on Measurement and modeling of computer systems
On the accuracy of embeddings for internet coordinate systems
IMC '05 Proceedings of the 5th ACM SIGCOMM conference on Internet Measurement
Network coordinates in the wild
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Internet routing policies and round-trip-times
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
| Hi-index | 0.00 |
Several coordinate bases embedding schemes have been proposed for scalable estimation of network distance (round trip time) among Internet hosts. These schemes may be broadly categorized into Landmark and distributed peer-to-peer based. While Landmark based approaches suffer from scalability due to the large amount of measurement loads, distributed schemes suffer from stability and accuracy issues in the presence of node churns. In this paper, we propose CSHE, a cluster based statistical approach for the network distance embedding that combines the stability of Landmark scheme and the scaling property of distributed approach. CSHE groups the nodes into a set of clusters where a new node embeds itself into the coordinate space by computing its distance against a set of nodes that are randomly chosen from each cluster. Using real measurement traces, we evaluate the accuracy and robustness of CSHE. We find that the accuracy of CSHE is comparable to the best known accurate embedding (GNP based embedding) and does not suffer with node churns.