Distributed Computing

, Volume 22, Issue 4, pp 249–267

Towards worst-case churn resistant peer-to-peer systems


DOI: 10.1007/s00446-010-0099-z

Cite this article as:
Kuhn, F., Schmid, S. & Wattenhofer, R. Distrib. Comput. (2010) 22: 249. doi:10.1007/s00446-010-0099-z


Until now, the analysis of fault tolerance of peer-to-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 article, we devise techniques to build dynamic peer-to-peer systems which remain fully functional in spite of an adversary who continuously adds and removes peers. We exemplify our algorithms on hypercube and pancake topologies and present a system which maintains small peer degree and network diameter.


Churn Dynamic networks Fault-tolerance Overlay network Peer-to-peer 

Copyright information

© Springer-Verlag 2010

Authors and Affiliations

  1. 1.Faculty of InformaticsUniversity of LuganoLuganoSwitzerland
  2. 2.Deutsche Telekom Laboratories (T-Labs)Technische Universität BerlinBerlinGermany
  3. 3.Computer Engineering an Networks LaboratoryETH ZurichZurichSwitzerland

Personalised recommendations