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

J. Altmann, Zelalem Berhanu Bedane
{"title":"A P2P File Sharing Network Topology Formation Algorithm Based on Social Network Information","authors":"J. Altmann, Zelalem Berhanu Bedane","doi":"10.1109/INFCOMW.2009.5072101","DOIUrl":null,"url":null,"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.","PeriodicalId":252414,"journal":{"name":"IEEE INFOCOM Workshops 2009","volume":"237 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM Workshops 2009","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOMW.2009.5072101","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于社交网络信息的P2P文件共享网络拓扑形成算法
本文将社交网络理论应用于P2P系统,创建了一种基于社交网络的P2P网络拓扑形成算法,用于文件共享。该算法扩展了Gnutella P2P文件共享技术,该技术使用超级节点在位于防火墙/ nat后面的网络叶子之间搜索和转发共享文件。P2P网络的拓扑结构基于对等体(用户)之间的实际社会关系。这个想法是,如果用户知道他们的资源能直接使他们的朋友和家人受益,他们就愿意将他们的资源贡献给P2P网络。按照这种方法,P2P网络中的搭便车行为将会避免,因为如果对等者不透露他们的社会关系,就不会提供比基本服务更好的服务。在本文中,考虑到Gnutella P2P网络的真实特性和现实的网络拓扑结构,我们对所提出的拓扑形成算法进行了仿真。仿真结果表明了拓扑形成算法的有效性和该方案下节点的高利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Online Maximizing Weighted Throughput in a Fading Channel Experimental Analysis of Flow Optimization and Data Compression for TCP Enhancement Enhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks Optimizing the DVB-SH FEC Scheme for Efficient Erasure Recovery Exploiting Alternative Paths in MHWNs: A Source-Based QoS Routing Approach
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1