Performance and Dependability of Structured Peer-to-Peer Overlays

  • Authors:
  • Miguel Castro;Manuel Costa;Antony Rowstron

  • Affiliations:
  • Microsoft Research, UK;Microsoft Research, UK;Microsoft Research, UK

  • Venue:
  • DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Structured peer-to-peer (p2p) overlay networks providea useful substrate for building distributed applications.They map object keys to overlay nodes and offer a primitiveto send a message to the node responsible for a key.They can implement, for example, distributed hash tablesand multicast trees. However, there are concerns about theperformance and dependability of these overlays in realisticenvironments. Several studies have shown that currentp2p environments have high churn rates: nodes join andleave the overlay continuously. This paper presents techniquesthat continuously detect faults and repair the overlayto achieve high dependability and good performance inrealistic environments. The techniques are evaluated usinglarge-scale network simulation experiments with fault injectionguided by real traces of node arrivals and departures.The results show that previous concerns are unfounded; ourtechniques can achieve dependable routing in realistic environmentswith an average delay stretch below two and amaintenance overhead of less than half a message per secondper node.