DagSemProc.06131.4.pdf
- Filesize: 146 kB
- 5 pages
Document
On the Topologies Formed by Selfish Peers
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6131
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-12-15
Cite AsGet BibTex
Stefan Schmid, Thomas Moscibroda, and Roger Wattenhofer. On the Topologies Formed by Selfish Peers. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)
https://doi.org/10.4230/DagSemProc.06131.4
https://doi.org/10.4230/DagSemProc.06131.4
Abstract
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.
Keywords
- Churn
- Selfishness
- P2P Topologies
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads