Over the Internet today, computing and communications environments are significantly more
complex and chaotic than classical distributed systems, lacking any centralized organization …

We propose a new exact method for shortest-path distance queries on large-scale networks.
Our method precomputes distance labels for vertices by performing a breadth-first search …

Large-scale Internet applications can benefit from an ability to predict round-trip times to
other hosts without having to contact them first. Explicit measurements are often unattractive …

The Internet infrastructure is severely stressed. Rapidly growing overheads associated with
the primary function of the Internet—routing information packets between any two computers …

In this paper, we present the design, implementation, and evaluation of iPlane, a scalable
service providing accurate predictions of Internet path performance for emerging overlay …

A highly accurate client-independent geolocation service stands to be an important goal for
the Internet. Despite an extensive research effort and significant advances in this area, this …

Geolocation of Internet hosts enables a diverse and interesting new class of location-aware
applications. Previous measurement-based approaches use reference hosts, called …

The performance of many networked applications improves when Round Trip Time (RTT) is
reduced. With lower RTTs, human-to-human interactions become more realistic, query …

In this paper we study approximate landmark-based methods for point-to-point distance
estimation in very large networks. These methods involve selecting a subset of nodes as …

With the technical advances in ubiquitous computing and wireless networking, there has
been an increasing need to capture the context information (such as the location) and to …