One of the most striking properties of the Internet is its flexibility to accommodate features it
was not conceived for. Among the most significant examples, in this survey we consider the …

We present Tapestry, a peer-to-peer overlay routing infrastructure offering efficient, scalable,
location-independent routing of messages directly to nearby copies of an object or service …

The rapid increase of sensitive data and the growing number of government regulations that
require longterm data retention and protection have forced enterprises to pay serious …

This paper addresses the problem of churn--the continuous process of node arrival and
departure--in distributed hash tables (DHTs). We argue that DHTs should perform lookups …

Designing distributed computing systems is a complex process requiring a solid
understanding of the design problems and the theoretical and practical aspects of their …

The main challenge in P2P computing is to design and implement a robust and scalable
distributed system composed of inexpensive, individually unreliable computers in unrelated …

Attempts to generalize the Internet's point-to-point communication abstraction to provide
services like multicast, anycast, and mobility have faced challenging technical problems and …

Koorde is a new distributed hash table (DHT) based on Chord 15 and the de Bruijn graphs
2. While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

OceanStore is an Internet-scale, persistent data store designed for incremental scalability,
secure sharing, and long-term durability. Pond is the OceanStore prototype; it contains many …