A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves

A Blueprint for Constructing Peer-to-Peer Systems Robust to Dynamic Worst-Case Joins and Leaves

Abstract

Until now, the analysis of fault tolerance of peerto-peer systems usually only covers random faults of some kind. Contrary to traditional algorithmic research, faults as well as joins and leaves occurring in a worst-case manner are hardly considered. In this paper, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary which continuously adds and removes peers. We exemplify our algorithms on a pancake topology and present a system which maintains peer degree and network diameter O( log n log log n ), where n is the total number of peers in the system.

Grafik Top
Authors
  • Kuhn, Fabian
  • Schmid, Stefan
  • Smit, Joest
  • Wattenhofer, Roger
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
14th IEEE International Workshop on Quality of Service (IWQoS)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Yale University, New Haven, Connectitut, USA
Event Type
Workshop
Event Dates
June 2006
Date
2006
Export
Grafik Top