Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Schmid, Stefan; Moscibroda, Thomas; Wattenhofer, Roger License: Creative Commons Attribution 4.0 license (CC BY 4.0)
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6431

; ;

On the Topologies Formed by Selfish Peers



Many P2P systems are only proven efficient for static environments.
However, in practice, P2P systems are often very dynamic in the sense that
peers can join and leave a system at any time and concurrently. In the first
part of my talk, I will present a DHT we have developed recently in our
group which maintains desirable properties under worst-case churn. In the
second part of my talk, we will briefly look at another challenge of prime
importance in P2P computing, namely selfishness. Concretely, some results
are presented concerning the impact of selfish behavior on the performance
of P2P topologies.

BibTeX - Entry

  author =	{Schmid, Stefan and Moscibroda, Thomas and Wattenhofer, Roger},
  title =	{{On the Topologies Formed by Selfish Peers}},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{6131},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-6431},
  doi =		{10.4230/DagSemProc.06131.4},
  annote =	{Keywords: Churn, Selfishness, P2P Topologies}

Keywords: Churn, Selfishness, P2P Topologies
Seminar: 06131 - Peer-to-Peer-Systems and -Applications
Issue date: 2006
Date of publication: 15.12.2006

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI