An Empirically Validated Framework for Limiting Free-Riding in P2P Networks Through the Use of Social Network Information
In order to overcome the problem of free-riding in current P2P system, we suggest applying social network theory. Based on our exploration of the overlapping research fields of social networks and peer-to-peer networks, we propose a new P2P framework within this paper. It specifies social network information that can be used in a P2P system to avoid performance inefficiencies caused by free-riding or by policies to overcome free-riding. To identify this specific social network information, we conduct a survey among a small group of students, who use Skype, a popular P2P system. We use descriptive analysis and multiple regression analysis to analyze the survey data. The results of the analyses provide an indication that the idea of using social network information in P2P systems is valid and that it is supported by P2P users. Based on our findings, we make recommendations for a successful implementation of social-network-information-based P2P systems that can overcome free-riding issues and, consequently, improve the performance of P2P systems.
|Date of creation:||Jun 2010|
|Date of revision:||Jun 2010|
|Publication status:||Published in PACIS2010, Pacific Asia Conference on Information Systems, PACIS 2010, Taipei, Taiwan, July 2010|
|Contact details of provider:|| Postal: 599 Gwanak-Ro, Gwanak-Gu, Seoul 151-744|
Web page: http://temep.snu.ac.kr/
More information through EDIRC
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Jorn Altmann & Zelalem Berhanu Bedane, 2010. "A P2P File Sharing Network Topology Formation Algorithm Based on Social Network Information," TEMEP Discussion Papers 201049, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Jan 2010.
When requesting a correction, please mention this item's handle: RePEc:snv:dp2009:201060. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Jorn Altmann)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.