摘要: Internet coordinate schemes have been proposed as a method for estimating minimum round trip time between hosts without direct measurement. In such scheme, each host is assigned set of coordinates, and Euclidean distance used to form the desired estimate. Two key questions are: How accurate are across whole? And: assignment fast enough, scalable large scale use? this paper we make contributions toward answering both those questions. Whereas problem has in past approached by nonlinear optimization, develop faster based on dimensionality reduction Lipschitz embedding. We show that reasonably accurate, even when applied measurements spanning Internet, it naturally leads measurement strategy notion virtual landmarks.