期刊文献+

基于TIT FOR TAT策略的P2P阻塞算法

P2P Blocking Algorithm Based on TIT FOR TAT Strategy
下载PDF
导出
摘要 为了提高P2P系统的传输效率,在TIT FOR TAT策略和帕累托理论的基础上,提出了P2P阻塞算法,详细阐述了算法的过程和特点,分析了算法在快速复制系统稀缺资源和共享较大文件的多用户系统中的性能及优势,同时试验数据证明了此算法在P2P系统中有较好的传输性能. To improve the transfer efficiency of P2P systems, a P2P blocking algorithm is proposed based on the introduction of “tit for tat” strategy and Pareto Theory. This article discusses in detail the procedures and features of this algorithm, analyses its performances and advantages in fast replication of system's scarce resources and sharing of bigger files in mialti user systems, and confirms that the algorithm can effectively improve the transfer properties of P2P systems by experimental data.
作者 肖钢 金连甫
出处 《江南大学学报(自然科学版)》 CAS 2005年第5期497-500,共4页 Joural of Jiangnan University (Natural Science Edition) 
关键词 对等点 阻塞 关注 一报还一报 帕累托 Peer blocking attention TIT-FOR-TAT Pareto
  • 相关文献

参考文献6

  • 1李振武,杨舰,白英彩.对等网络研究及其挑战[J].计算机应用与软件,2004,21(2):54-55. 被引量:25
  • 2Daswani N, Garcia-Molina H, Yang B. Open Problems in Data-Sharing Peer-to-Peer Systems[M]. Heidelberg: Springer-Verlag, 2003.
  • 3陈龙发.帕累托福利经济学基本思想述评[J].经济学动态,1992(10):65-69. 被引量:1
  • 4孔祥云, 王玉荣. 博弈论的经典案例:囚徒困境[EB/OL]. http://blog.codelphi.com/jerryshen/articles/16814.aspx, 1999-10-19.
  • 5Craig Hunt. TCP/IP Network Administration [M]. 北京: 中国电力出版社,1999.
  • 6周天明 汪文勇.TCP/IP网络原理与技术[M].北京:清华大学出版社,1993.180-199.

二级参考文献9

  • 1[1]Li Gong.Peer-to-Peer Networks in Action.IEEE Interent Computing,January/February 2002.
  • 2[2]Napster.http:∥www.napster.com.
  • 3[3]Peer-to-Peer Working Group Committees.http:∥peer-to-peerwg.org/.
  • 4[4]Gnutella.http:∥gnutella.wego.com/.
  • 5[5]CLARKE,I.,SANDBERG,O.,WILEY,B.,AND HONG,T.W.Freenet:A distributed anonymous information storage and retrieval system.In Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability(Berkeley,California,June 2000).
  • 6[6]Ion Stoica,Robert Morris,David Karger,M.Frans Kaashoek,and Hari Balakrishnan.Chord:A scalable peer-to-peer lookup service for internet applications.In Proc.ACM SIGCOMM 2001,August 2001.
  • 7[7]Sylvia Ratnasamy,Paul Francis,Mark Handley,Richard Karp,and Scott Shenker.A scalable content-addressable network.In Proc.ACM SIGCOMM 2001,August 2001.
  • 8[8]DRUSCHEL,P.,AND ROWSTRON,A.Pastry:Scalable,distributed object location and routing for large-scale peer-to-peer system.In Proceeings of the 18th IFIP/ACM International Conference on Distributed Systems Platforms(Middleware 2001)W(Nov 2001).
  • 9[9]ZHAO,B.Y.,KUBIATOWICZ,J.,AND JOSEPH,A.Tapstry:An infrastructure for fault-tolerant wide-area location and routing.Tech.Rep.UCB/CSD-01-1141,University of California at Berkeley,Computer Science Department,2001.

共引文献33

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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