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 performance of many networked applications improves when Round Trip Time (RTT) is
reduced. With lower RTTs, human-to-human interactions become more realistic, query …

During the last decade, a new class of large-scale globally-distributed network services and
applications have emerged. Those systems are flexible in the sense that they can select …

This paper introduces a lightweight, scalable and accurate framework, called Meridian, for
performing node selection based on network location. The framework consists of an overlay …

Efficient and scalable live-streaming overlay construction has become a hot topic recently. In
order to improve the performance metrics, such as startup delay, source-to-end delay, and …

Low-latency anonymity systems such as Tor, AN. ON, Crowds, and Anonymizer. com aim to
provide anonymous connections that are both untraceable by “local” adversaries who …

Researchers involved in designing network services and protocols rely on results from
simulation and emulation environments to understand their application performance and …

We describe the design and implementation of SWORD, a scalable resource discovery
service for wide-area distributed systems. In contrast to previous systems, SWORD allows …

Many distributed systems rely on neighbor selection mechanisms to create overlay
structures that have good network performance. These neighbor selection mechanisms …

Many peer-to-peer distributed applications can benefit from accurate predictions of Internet
path performance. Existing approaches either 1) achieve high accuracy for sophisticated …