2006/01/01 by Stefan Schmid, Schmid, Stefan, Fabian Kühn +5
Computer Science · #Caching and Content Delivery #Churn #Distributed systems and fault tolerance #P2P Topologies #Peer-to-Peer Network Technologies #Selfishness
paper · doi:10.4230/dagsemproc.06131.5
openalex publication_date 2006/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Peer-to-peer systems are often faced with the problem of frequent membership changes. However, many systems are only proven efficient or correct in static environments. In my talk, I will present techniques to maintain desirable properties of a distributed hash table (low peer degree, low network diameter) in spite of ongoing and concurrent dynamics. I will then go on and study the effect of peers not acting according to our protocols. Concretely, I assume that peers are selfish and choose the behavior which maximizes their utility. I will report on our results concerning the impact of selfishness on the peer-to-peer topology.