Rescuing Tit-for-Tat with Source Coding

Rescuing Tit-for-Tat with Source Coding

Abstract

Tit-for-tat is widely believed to be the most effective strategy to enforce collaboration among selfish users. However, it has been shown that its usefulness for decentralized and dynamic environments such as peer-topeer networks is marginal, as peers can rapidly end up in a deadlock situation. Many proposed solutions to this problem are either less resilient to freeloading behavior or induce a computational overhead that cannot be sustained by regular peers. In contrast, we retain tit-fortat, but enhance the system with a novel form of source coding and an effective scheme to prevent peers from freeloading from seeding peers. We show that our system performs well without the risk of peer starvation and without sacrificing fairness. The proposed solution has a reasonably low overhead, and may hence be suitable for fully distributed content distribution applications in real networks.

Grafik Top
Authors
  • Locher, Thomas
  • Schmid, Stefan
  • Wattenhofer, Roger
Grafik Top
Supplemental Material
Shortfacts
Category
Paper in Conference Proceedings or in Workshop Proceedings (Paper)
Event Title
7th IEEE International Conference on Peer-to-Peer Computing (P2P)
Divisions
Communication Technologies
Subjects
Informatik Allgemeines
Event Location
Galway, Ireland
Event Type
Conference
Event Dates
September 2007
Date
2007
Export
Grafik Top