Learn More
The pace of research on peer-to-peer (P2P) networking in the last five years warrants a critical survey. P2P has the makings of a disruptive technology it can aggregate enormous storage and processing resources while minimizing entry and scaling costs. Failures are common amongst massive numbers of distributed peers, though the impact of individual failures(More)
Algorithms by which peers join and leave structured overlay networks can be classified as passive or active. Passive topology maintenance relies on periodic background repair of neighbor pointers. When a node passively leaves the overlay, subsequent lookups may fail silently. Active maintenance has been proven only for fault-free networks. We develop an(More)
A location service is the part of a naming architecture that maps identifiers to network addresses. Ideally, the identifiers are globally unique, persistent and semantic-free. It has been acknowledged that Distributed Hash Tables (DHTs) enable, for the first time, the use of semantic-free identifiers in massive, global networks. We argue that hierarchy is(More)
Many distributed hash tables (DHTs) resolve lookups in O(\log n) hops, where n is the number of nodes. One-hop DHTs give lower lookup latencies and lower lookup failure rates. However, it is hard to maintain large, wide-area one-hop topologies. We contribute aecast, a new topology dissemination algorithm for one-hop DHTs. It avoids expensive repair(More)
Internet service providers need ways to improve the dependability of their email services. Existing single-site and multi-site, synchronously replicated message stores have low availability. Recovery of multi-site, asynchronously replicated stores is slow and inconsistent. This paper's two-dimensional Markov analysis shows that the availability of an email(More)
  • 1