Advanced Search
MyIDEAS: Login to save this paper or follow this series

A P2P File Sharing Network Topology Formation Algorithm Based on Social Network Information

Contents:

Author Info

  • Jorn Altmann

    ()

  • Zelalem Berhanu Bedane

    (Technology Management, Economics, and Policy Program (TEMEP), Seoul National University)

Abstract

This paper applies the theory of social networks to P2P systems, creating a social-network-based P2P network topology formation algorithm for file sharing. The algorithm extends the Gnutella P2P file sharing technology, which uses super nodes for searching and for relaying shared files between network leafs that are located behind Firewalls/NATs. The topology of the P2P network is based on the actual social relationship between peers (users). The idea is that users are willing to contribute their resources to a P2P network if they know that their resources directly benefit their friends and family. Following this approach, free-riding in P2P networks will be avoided by not providing better-than-basic service if peers do not reveal their social relationships. Within the paper, we simulate the proposed topology formation algorithm, considering the real characteristics of the Gnutella P2P network and realistic network topologies. The simulation shows the effectiveness of the topology formation algorithm and the high utility of nodes under this new file sharing scheme.

Download Info

If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
File URL: ftp://147.46.237.98/DP-49.pdf
File Function: First version, 2010
Download Restriction: no

Bibliographic Info

Paper provided by Seoul National University; Technology Management, Economics, and Policy Program (TEMEP) in its series TEMEP Discussion Papers with number 201049.

as in new window
Length: 18 pages
Date of creation: Jan 2010
Date of revision: Jan 2010
Publication status: Published in NetSciCom2009, IEEE International Workshop on Network Science For Communication Networks, in conjunction with IEEE Infocom 2009, April 2009
Handle: RePEc:snv:dp2009:201049

Contact details of provider:
Postal: 599 Gwanak-Ro, Gwanak-Gu, Seoul 151-744
Phone: +82-2-880-8386
Fax: +82-2-873-7229
Email:
Web page: http://temep.snu.ac.kr/
More information through EDIRC

Related research

Keywords: Social network analysis; peer-to-peer; economics; network science; free-riding; file sharing; sociology; NATs; utility; Gnutella; Firewalls; network economics; incentive mechanisms;

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

References

No references listed on IDEAS
You can help add them by filling out this form.

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Fatmawati Zifa & Jorn Altmann, 2010. "An Empirically Validated Framework for Limiting Free-Riding in P2P Networks Through the Use of Social Network Information," TEMEP Discussion Papers, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP) 201060, Seoul National University; Technology Management, Economics, and Policy Program (TEMEP), revised Jun 2010.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:snv:dp2009:201049. 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.