期刊文献+

Free-riders Impact on Throughputs of Peer-to-peer File-sharing Systems

Free-riders Impact on Throughputs of Peer-to-peer File-sharing Systems
原文传递
导出
摘要 In a peer-to-peer file-sharing system, a free-rider is a node which downloads files from its peers but does not share files to other nodes. Analyzing the free-riders’ impact on system throughputs is essential in examining the performance of peer-to-peer file-sharing systems. We find that the free-riders’ impact largely depends on nodes behavior, including their online time and greed of downloading files. We extend an existing peer-to-peer system model and classify nodes according to their behavior. We focus on two peer-to-peer architectures: centralized indexing and distributed hash tables. We find that when the cooperators in a system are all greedy in downloading files, the system throughput has little room to increase while the cooperators throughput degrade badly with the increasing percent of greedy free-riders in the system. When all the cooperators are non-greedy with long average online time, the system throughput has much room to increase and the cooperators throughput degrade little with a high percent of greedy free-riders in the system. We also find that if a system can tolerate a high percent of greedy free-riders without suffering much throughput degradation, the system must contain some non-greedy cooperators that contribute great idle service capacity to the system. In a peer-to-peer file-sharing system, a free-rider is a node which downloads files from its peers but does not share files to other nodes. Analyzing the free-riders' impact on system throughputs is essential in examining the performance of peer-to-peer file-sharing systems. We find that the free-riders' impact largely depends on nodes behavior, including their online time and greed of downloading files. We extend an existing peer-to=peer system model and classify nodes according to their behavior. We focus on two peer-to-peer architectures: centralized indexing and distributed hash tables. We find that when the cooperators in a system are all greedy in downloading files, the system throughput has little room to increase while the cooperators throughput degrade badly with the increasing percent of greedy free-riders in the system. When all the cooperators are non-greedy with long average online time, the system throughput has much room to increase and the cooperators throughput degrade little with a high percent of greedy free-riders in the system. We also find that if a system can tolerate a high percent of greedy free-riders without suffering much throughput degradation, the system must contain some non-greedy cooperators that contribute great idle service capacity to the system.
机构地区 School of Electronic
出处 《Journal of Shanghai Jiaotong university(Science)》 EI 2009年第3期273-278,共6页 上海交通大学学报(英文版)
基金 the National High Technology Re-search and Development Program (863) of China(No. 2007AA01Z457) the Shanghai Science and Technology Development Funds (No. 07QA14033)
关键词 文件共享系统 吞吐量 点对点 免费 下载文件 分布式哈希表 共享文件 影响系统 peer-to-peer, file sharing, free-rider, throughput, service capacity, greedy ratio
  • 相关文献

参考文献10

  • 1Ge Z,Figueiredo D,Jaiswal S, et al.Model- ing peer-peer file sharing systems[].Proceedings IEEE INFOCOM.2003
  • 2Qiu D,Srikant R.Modeling and performance analysis of BitTorrent-like peer-to-peer networks[].Proceedings of ACM SIGCOMM.2004
  • 3Gummadi K P,Dunn R J,Saroiu S, et al.Mea- surement modeling and analysis of a peer-to-peer file- sharing workload[].Proceedings of the th ACM Symposium on Operating Systems Principles.2003
  • 4Ratnasamy S,Francis P,Handley M, et al.A scal- able content-addressable network[].Proceedings of ACM SIGCOMM.2001
  • 5Sen S,Wang J.Analyzing peer-to-peer traffic across large networks[].IEEE ACM Transactions on Networking.2004
  • 6Rowstron A,Druschel P.Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems[].Proceedings of the th IFIP/ACM International Conference on Distributed Systems Platforms (Middleware.2001
  • 7Stoica I,Morris R,Karger D,et al.Chord:A Scalable Peer-to-Peer Lookup Service for Internet Applications[].Proceedings of the SIGCOMM Conference.2001
  • 8YANG X,VECIANA G D.Service capacity in peer-to-peer networks[]..2004
  • 9Adar E,Huberman B.Free riding on gnutella[].First Monday.2000
  • 10Saroiu S,Gummadi P K,Gribble S D.A measurement study of peer-to-peer file sharingsystems[].Proceed ings of the Multimedia Computing and Networking Conf erence.2002

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部