Dependable peer-to-peer systems withstanding dynamic adversarial churn

Authors:
Keno Albrecht;Fabian Kuhn;Roger Wattenhofer
Affiliations:
Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland;Computer Engineering and Networks Laboratory, ETH Zurich, Zurich, Switzerland
Venue:
Dependable Systems
Year:
2006

Citing 28
Cited 2

The token distribution problem

SIAM Journal on Computing
Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
Load balancing, selection sorting on the hypercube

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
Accessing nearby copies of replicated objects in a distributed environment

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
OceanStore: an architecture for global-scale persistent storage

ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Chord: A scalable peer-to-peer lookup service for internet applications

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Wide-area cooperative storage with CFS

SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Censorship resistant peer-to-peer content addressable networks

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Viceroy: a scalable and dynamic emulation of the butterfly

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Scheduling and Load Balancing in Parallel and Distributed Systems

Scheduling and Load Balancing in Parallel and Distributed Systems
Skip graphs

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Kademlia: A Peer-to-Peer Information System Based on the XOR Metric

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Dynamically Fault-Tolerant Content Addressable Networks

IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
P-Grid: A Self-Organizing Access Structure for P2P Information Systems

CooplS '01 Proceedings of the 9th International Conference on Cooperative Information Systems
Astrolabe: A robust and scalable technology for distributed system monitoring, management, and data mining

ACM Transactions on Computer Systems (TOCS)
A Generic Scheme for Building Overlay Networks in Adversarial Scenarios

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
PAST: A Large-Scale, Persistent Peer-to-Peer Storage Utility

HOTOS '01 Proceedings of the Eighth Workshop on Hot Topics in Operating Systems
The hyperring: a low-congestion deterministic data structure for distributed environments

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
LAND: stretch (1 + ε) locality-aware networks for DHTs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Ivy: a read/write peer-to-peer file system

OSDI '02 Proceedings of the 5th symposium on Operating systems design and implementationCopyright restrictions prevent ACM from being able to make the PDFs for this conference available for downloading
Gossip-based aggregation in large dynamic networks

ACM Transactions on Computer Systems (TOCS)
Handling churn in a DHT

ATEC '04 Proceedings of the annual conference on USENIX Annual Technical Conference
SkipNet: a scalable overlay network with practical locality properties

USITS'03 Proceedings of the 4th conference on USENIX Symposium on Internet Technologies and Systems - Volume 4
Approximate object location and spam filtering on peer-to-peer systems

Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Willow: DHT, aggregation, and publish/subscribe in one protocol

IPTPS'04 Proceedings of the Third international conference on Peer-to-Peer Systems
Tapestry: a resilient global-scale overlay for service deployment

IEEE Journal on Selected Areas in Communications

Maintaining the Ranch topology

Journal of Parallel and Distributed Computing
Tiara: A self-stabilizing deterministic skip list and skip graph

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The most essential difference between classical distributed data structures and peer-to-peer systems is the dynamic behavior of the latter. Unlike traditional systems which consist of a fixed set of machines of which a few might occasionally fail in some way, peer-to-peer systems are characterized by continuous joins and leaves at a high rate (called churn). We address this dynamism in two ways. We present a general information aggregation method which can be used to implement deterministic join and leave protocols which keep the network in a well-balanced state. We also use the information aggregation algorithm together with a primitive called token distribution to obtain a general way of constructing efficient peer-to-peer systems which are resilient to dynamic, adversarial joins and leaves. In each time step, an adversary is allowed to insert and delete a bounded number of arbitrary peers. The system adapts to this churn by rearranging peers or adjusting the topology whenever necessary.