Please use this identifier to cite or link to this item:
Title: A peer-to-peer cooperation enhancement scheme and its performance analysis
Authors: Liao, Wei Cherng 
Psounis, Konstantinos
Papadopoulos, Fragkiskos 
Keywords: P2P networks | Realistic simulations | Theoretical analysis | User cooperation
Category: Electrical Engineering - Electronic Engineering - Information Engineering
Field: Engineering and Technology
Issue Date: 1-Jan-2006
Source: Journal of Communications, Volume 1, Number 7, November/December 2006
Journal: Journal of Communications 
Abstract: The performance of peer-to-peer systems depends on the level of cooperation of the system's participants. While most existing peer-to-peer architectures have assumed that users are generally cooperative, there is great evidence from widely deployed systems suggesting the opposite. To date, many schemes have been proposed to alleviate this problem. However, the majority of these schemes are either too complex to use in practice, or do not provide strong enough incentives for cooperation. In this work we propose a scheme based on the general idea that offering uploads brings revenue to a user, and performing downloads has a cost. We also introduce a theoretical model that predicts the performance of the system and computes the values of the scheme's parameters that achieve a desired performance. Our scheme is quite simple and very easy to implement. At the same time, it provides very strong incentives for cooperation and improves the performance of P2P networks significantly. In particular, theory and realistic simulations show that it reduces the query response times and file download delays by one order of magnitude, and doubles the system's throughput. © 2006 ACADEMY PUBLISHER.
ISSN: 1796-2021
DOI: 10.4304/jcm.1.7.24-35
Type: Article
Appears in Collections:Άρθρα/Articles

Show full item record

Citations 20

checked on Nov 20, 2019

Page view(s)

Last Week
Last month
checked on Nov 22, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.