Fairness in Peer-to-Peer Networks
AuthorsKolja Eger,Ulrich Killat
- Part of: Volume:Dagstuhl Seminar Proceedings, Volume 6131
Part of: Series:Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license - Publication Date: 2007-01-30
File
PDF
DagSemProc.06131.3.pdf
- Filesize: 393 kB
- 6 pages
Document Identifiers
Subject Classification
Keywords
- Pricing
- Rate Control
- Resource Allocation
- Distributed Optimisation
- Fairness
- P2P Networks
Metrics
- Access Statistics
- Total Accesses (updated on a weekly basis)0PDF Downloads0Metadata Views
Abstract
The first Peer-to-Peer (P2P) networks were based mainly on thealtruistic behaviour of its peers. Although newer implementationsincorporate some kind of incentive mechanism to award sharing peers, noP2P network assures some quality of service.Our work is meant as a first step towards the development of P2Pnetworks with quality of service. We propose a distributed resourceallocation algorithm where peers control the service rate to itsneighbours. This algorithm is based on the congestion pricing principleknown from IP networks and ensures some form of fairness. Hence a peergets a fair share of the resources available in the P2P network weightedby its contribution to the network.We present the first simulation results about the convergence of ouralgorithm and its functionality in large and varying networks.
Cite AsGet BibTex
Kolja Eger and Ulrich Killat. Fairness in Peer-to-Peer Networks. In Peer-to-Peer-Systems and -Applications. Dagstuhl Seminar Proceedings, Volume 6131, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)https://doi.org/10.4230/DagSemProc.06131.3