When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-6452
Go to the corresponding Portal

Eger, Kolja ; Killat, Ulrich

Fairness in Peer-to-Peer Networks

06131.EgerKolja.ExtAbstract.645.pdf (0.4 MB)


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.

BibTeX - Entry

  author =	{Kolja Eger and Ulrich Killat},
  title =	{Fairness in Peer-to-Peer Networks},
  booktitle =	{Peer-to-Peer-Systems and -Applications},
  year =	{2007},
  editor =	{Anthony D. Joseph and Ralf Steinmetz and Klaus Wehrle},
  number =	{06131},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{},
  annote =	{Keywords: Pricing, Rate Control, Resource Allocation, Distributed Optimisation, Fairness, P2P Networks}

Keywords: Pricing, Rate Control, Resource Allocation, Distributed Optimisation, Fairness, P2P Networks
Seminar: 06131 - Peer-to-Peer-Systems and -Applications
Issue Date: 2007
Date of publication: 30.01.2007

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI