On the Estimation of Internet Distances Using Landmarks
Stijn van Langen, Xiaoming Zhou, Piet Van Mieghem · 2003
Abstract – Many networked applications can benefit from a quick estimation of distances to a large number of hosts. Landmark schemes provide such estimates based on distances in a hyperspace in which the hosts are embedded. We evaluate a simple landmark scheme using empirical data for both delay and hopcount. We investigate various choices for the hyperspace distance function. We also compare the measurements with si-mulations on random graphs with minimal link weight routing.