Paper Info
Title
Performance and dependability of structured peer-to-peer overlays
Abstract
Structured peer-to-peer (P2P) overlay networks provide a useful substrate for building distributed applications. They map object keys to overlay nodes and offer a primitive to send a message to the node responsible for a key. They can implement, for example, distributed hash tables and multicast trees. However, there are concerns about the performance and dependability of these overlays in realistic environments. Several studies have shown that current P2P environments have high churn rates: nodes join and leave the overlay continuously. This paper presents techniques that continuously detect faults and repair the overlay to achieve high dependability and good performance in realistic environments. The techniques are evaluated using large-scale network simulation experiments with fault injection guided by real traces of node arrivals and departures. The results show that previous concerns are unfounded; our techniques can achieve dependable routing in realistic environments with an average delay stretch below two and a maintenance overhead of less than half a message per second per node.
Year
DOI
Venue
2004
10.1109/DSN.2004.1311872
DSN '04 Proceedings of the 2004 International Conference on Dependable Systems and Networks
Keywords
Field
DocType
fault diagnosis,fault simulation,multicast communication,peer-to-peer computing,table lookup,trees (mathematics),P2P networks,distributed hash tables,fault detection,fault injection,multicast trees,network simulation,peer-to-peer overlay networks
Dependability,Computer science,Peer to peer overlay,Computer network,Network simulation,Real-time computing,Multicast,Overlay,Fault injection,Overlay network,Hash table,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2052-9
89
6.47
References 
Authors
19
3
Name
Order
Citations
PageRank
Miguel Castro15088328.69
Manuel Costa2158988.62
Antony Rowstron36605542.43