By Topic

A rational model for service rate allocation in peer-to-peer networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
M. Meo ; Politecnico di Torino, Italy ; F. Milan

In peer-to-peer networks, nodes can be both resource providers and resource consumers at the same time. In this sense, the services offered by a peer-to-peer network rely on resource sharing among peers. This work focuses on how peers share their access link capacity between upload and download rates. In our model peers are rational agents, and choose their strategy in order to maximize their own utility. We suppose that the bottleneck is not in the network core, but in the network edge: the access link capacity of each peer connected to the network is a scarce resource and the peers have to compete for it. Instead of trying to settle the controversies which can arise, we imagine that every peer organizes an auction to give away its bandwidth. While the service rate is always granted to the peer who makes the lowest request, the amount of allocated rate depends on the implemented auction mechanism. Numerical experiments show that in a peer-to-peer game where the access link capacities are homogeneous, a second-price auction guarantees that the equilibrium rate allocation is optimal.

Published in:

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.  (Volume:4 )

Date of Conference:

13-17 March 2005