期刊文献+

基于自适应组播机制的P2P阻塞算法研究

A P2P Block Algorithm Based On Self-adaptive Multicast Mechanism
在线阅读 下载PDF
导出
摘要 P2P网络中节点利用阻塞机制作为节点选择算法,以确定节点间相互的服务对象。但是在传统的节点阻塞算法中存在着节点连接时间过高,首块资源获得较慢,系统链路利用率不高等问题。提出一种自适应组播机制,利用动态分组的路由方法,充分考虑各节点间的可用带宽,能够很好的解决在传统阻塞算法中存在的首块资源获取过慢,带宽利用不高等问题。 Blocking mechanism is used as a node selection algorithm in P2P networks to determine the mutual client nodes. However traditional blocking algorithms may induce several shortcomings such as connection between nodes lasting too long, slow accessing to first block and low link utilization. An self - adaptive multicast mechanism is presented to solve those problems. The use of Considered the available bandwidth,the use of dynamic packets in routing between nodes makes the new algorithm outperform tranditional ones in accessing the first block and the bandwidth utilization in the system.
作者 丁勋 王东
出处 《计算技术与自动化》 2008年第2期138-140,144,共4页 Computing Technology and Automation
关键词 P2P 阻塞 自适应 组播 P2P block self- adaptive anycast
作者简介 丁勋(1982-).男,山东武城人.硕士研究生,研究方向:计算机网络及应用(E—mail:autosuggestion@163.com); 王东(1964-),男,江西九江人,教授,博士,研究方向:计算机网络协议分析.无线网络性能测试等。
  • 相关文献

参考文献8

  • 1Stephanos AT, Diomidis S. A survey of peer - to - peer content distribution technologies [ J ]. In: ACM Computing Surveys, 2004,36(4) : 335 - 371.
  • 2刘永卫,王东,黄昆,张大方.BitTorrent系统中一种自适应阻塞算法[J].计算机工程与应用,2007,43(34):122-124. 被引量:2
  • 3胡进锋,黎明,郑纬民,汪东升.带宽自适应的P2P网络路由协议[J].软件学报,2005,16(5):991-999. 被引量:14
  • 4The official bittorrent home page[EB/OL]: www. bittorrent.com.
  • 5B. Cohen. Incentives build robustness in bittorrent. In: Workshop on Economies of Peer - to - Peer Systems ( P2PEcon' 03) [J]. Berkeley, CA, USA, June, 2003.
  • 6D. Qiu and S. Srikant. Modeling and Performance Analysis of BitTorrent- Like Pert - to - Peer networks [ J ]. In: Proc. SIGCOMM, 2004.
  • 7Reaz Ahmed and Raouf Boutaba:Distributed Pattern Matching: A Key to Flexible and Efficient P2P Search[J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 25, NO. 1, JANUARY,2007.
  • 8Rongmei Zhang, Y. Charlie Hu, Assisted Peer - to- Peer Searchwith Partial Indexing IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS[J]. VOL. 18, NO. 8, AUGUST, 2007.

二级参考文献17

  • 1Zhao B, Kubiatowicz J, Joseph A. Tapestry: An infrastructure for fault-tolerant wide-area location and routing. Technical Report UCB/CSD-01-1141, Berkeley: Computer Science Division, 2001.
  • 2Rowstron A, Druschel P. Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems. In: Proc. of the Int'l Conf. on Distributed Systems Platforms 2001. http://research.microsoft.com/~antr/Pastry/
  • 3Ratnasamy S, Francis P, Handley M, Karp R, Shenker S. A scalable content-addressable network. In: Proc. of the SIGCOMM 2001.2001. http://www.acm.org/sigs/sigcomm/sigcomm2001 /
  • 4Cox R, Muthitacharoen A, Morris R. Serving DNS using chord. In: Proc. of the 1st Int'l Workshop on Peer-to-Peer Systems. 2002.http://www.cs.rice.edu/Conferences/IPTPS02/
  • 5Jain S, Mahajan R, Wetherall D. A study of the performance potential of DHT-based overlays. In: Proc. of the 4th USENIX Symp.on Internet Technologies and Systems. 2003. http://www.usenix.org/events/usits03/
  • 6Gupta A, Liskov B, Rodrigues R. One hop lookups for peer-to-peer overlays. In: Proc. of the 9th Workshop on Hot Topics in Operating Systems. 2003. http://www.usenix.org/events/hotos03/
  • 7Xu J. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks. In: Proc .of the 22nd Annual Joint Conf. of the IEEE Computer and Communications Societies 2003. http://www.ieee-infocom.org/2003/
  • 8Gummadi K, Gummadi R, Gribble S, Ratnasamy S, Shenker S, Stoica I. The impact of DHT routing geometry on resilience and proximity. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 9Loguinov D, Kumar A, Rai V, Ganesh S. Graph-Theoretic analysis of structured peer-to-peer systems-routing distances and fault resilience. In: Proc. of the SIGCOMM 2003. 2003. http://www.acm.org/sigs/sigcomm/sigcomm2003/
  • 10Gupta I, Birman K, Linga P, Demers A, van Renesse R. Kelips: Building an efficient and stable P2P DHT through increased memory and background overhead In: Proc. of the 2nd Int'l Workshop on Peer-to-Peer Systems. 2003. http://iptps03.cs.berkeley.edu/

共引文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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