Fair resource allocation in peer-to-peer networks (extended version)

The first peer-to-peer (P2P) networks were based mainly on the altruistic behavior of the peers. Although newer implementations incorporate some kind of incentive mechanism to award sharing peers, no P2P network assures a guaranteed service rate. This article is meant as a first step towards the development of P2P networks with guaranteed service rate. We propose a distributed resource allocation algorithm where peers control the service rates to their neighbors. 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 study the convergence properties of the distributed algorithm and validate them by simulation. Further simulation results present the functionality of the algorithm in large and varying networks. The results indicate a fair allocation of the resources even when the service rates of some peers deteriorate due to errors.

[1]  Ulrich Killat,et al.  Resource marking and fair rate allocation , 2002, 2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333).

[2]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[3]  Eytan Adar,et al.  Free Riding on Gnutella , 2000, First Monday.

[4]  Panayotis Antoniadis,et al.  Comparing economic incentives in peer-to-peer networks , 2004, Comput. Networks.

[5]  Scott Shenker,et al.  Fundamental Design Issues for the Future Internet (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[6]  Ulrich Killat,et al.  Resource pricing in peer-to-peer networks , 2007, IEEE Communications Letters.

[7]  Richard J. La,et al.  Charge-sensitive TCP and rate control in the Internet , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[8]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[9]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[10]  B. Cohen,et al.  Incentives Build Robustness in Bit-Torrent , 2003 .

[11]  Peter B. Key,et al.  Resource Pricing for Differentiated Services , 2001, Kommunikation in Verteilten Systemen.

[12]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[13]  Raj Jain,et al.  The art of computer systems performance analysis - techniques for experimental design, measurement, simulation, and modeling , 1991, Wiley professional computing.

[14]  Ulrich Killat,et al.  Bandwidth Trading in Unstructured P2P Content Distribution Networks , 2006, Sixth IEEE International Conference on Peer-to-Peer Computing (P2P'06).

[15]  Kevin Leyton-Brown,et al.  Incentives for sharing in peer-to-peer networks , 2001, EC '01.

[16]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, and Performance , 2004, INFOCOM.

[17]  Venkata N. Padmanabhan,et al.  Analyzing and Improving BitTorrent Performance , 2005 .

[18]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..