2026-07-22T01:28:54Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:645 2024-03-06T11:06:47Z ddc:004 open_access

Fairness in Peer-to-Peer Networks Eger, Kolja Killat, Ulrich Pricing Rate Control Resource Allocation Distributed Optimisation Fairness P2P Networks The first Peer-to-Peer (P2P) networks were based mainly on the altruistic behaviour of its peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures some quality of service. Our work is meant as a first step towards the development of P2P networks with quality of service. We propose a distributed resource allocation algorithm where peers control the service rate to its neighbours. This algorithm is based on the congestion pricing principle known from IP networks and ensures some form of fairness. Hence a peer gets a fair share of the resources available in the P2P network weighted by its contribution to the network. We present the first simulation results about the convergence of our algorithm and its functionality in large and varying networks. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Kolja Eger and Ulrich Killat 2007 Is Part Of Dagstuhl Seminar Proceedings, Volume 6131, Peer-to-Peer-Systems and -Applications (2006) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagSemProc.06131.3 urn:nbn:de:0030-drops-6452 https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.06131.3 eng https://creativecommons.org/licenses/by/4.0/legalcode