Taming Dynamic and Selfish Peers

Peer-to-Peer-Systems and -Applications

计算机科学;物理学

Fabian Kuhn ; Thomas Moscibroda ; Stefan Schmid ; Roger Wattenhofer

Others  :  http://drops.dagstuhl.de/opus/volltexte/2006/647/pdf/06131.SchmidStefan.Paper.647.pdf
PID  :  6717

学科分类：计算机科学（综合）

来源: CEUR

【 摘 要 】

This paper addresses two important challenges for current P2P systems, namely churn and selfishness. First, we report on a system [19] whose desirable properties (small peer degree, small network diameter, etc.) are maintained in spite of ongoing and concurrent membership changes. Thereby, dynamic peers are "tamed" by redundancy. Due to the worst-case churn, this system may never be fully repaired, but always fully functional. However, it relies on the fact that peers act according to the protocol. In the second part of the paper (based on [22]), we study the impact of selfish peers which follow those pro- tocols which maximize their utility. In particular, the efficiency of topologies formed by selfish peers is considered. We show that even in the absence of joins and leaves, the resulting system may never stabilize. How to "tame" selfish peers towards a more cooperative behavior remains an open issue.