期刊文献+

基于邻近原则的BitTorrent实验研究 被引量:5

Experimental Study on Network Coordinate Based Locality-aware BitTorrent
下载PDF
导出
摘要 BitTorrent(BT)是一种基于P2P的文件共享软件,有着十分广泛的应用.在BT中,默认参与节点随机选择其它节点作为网络中的邻居构成覆盖网络,不能根据节点的位置优化覆盖网络,影响了BT中文件传输的性能.BT的有偏邻居选择,指的是BTTracker参照BTClient在互联网中的位置,向BT有针对性地提供相应的邻居,优化BT的覆盖网络,使得BT的文件传输效率得到提高.本文提出了一种基于邻近原则优化BT文件传输速率的机制.首先利用网络坐标对BT网络参与节点在互联网中的位置进行计算;之后,根据网络坐标,对于BT参与节点的邻居进行了有偏选择;BT参与节点经过分布式聚类得到基于邻近原则的覆盖网络.仿真实验显示,基于网络坐标的有偏邻居选择对于BT整体文件传输性能有较大的提升. BitTorrent (BT) is a widely used P2P file -sharing software. In basic BT, clients select their neighbors randomly to form the BT overlay network. As a result, they never consider the location of the participant nodes. This randomly constructed overlay will reduce the performance of the file transmission in BT. Biased neighbor selection in BT, means that BT tracker return the neighbor candidates to the BT clients according to their locations in Internet. This approach will improve the performance of the BT overlay network and increase the efficiency of the file transmission of BT. This paper proposes a scheme to construct the locality - aware BT overlay network to improve the performance of BT. Firstly, we use network coordinate to compute the location of the nodes. In addition, we help the BT clients to select their neighbors based on the locations of their network coordinates. Distributed node clustering will form a locality - aware BT overlay network. We use both simulation and experiments in Internet to prove that our network coordinate based locality - aware BT overlay will improve the efficiency of the file transmission a lot.
出处 《厦门大学学报(自然科学版)》 CAS CSCD 北大核心 2007年第A02期213-215,共3页 Journal of Xiamen University:Natural Science
基金 国家自然科学基金(60473087) 国家重点基础研究发展计划(973计划 2007CB310806)资助
关键词 BITTORRENT 网络坐标 有偏邻居选择 邻近原则 BitTorrent network coordinate neighbor selection locality- aware
  • 相关文献

参考文献7

  • 1BitTorrent Website [EB/OL]. 2007-08-15. http ://www. bittorrent.com/.
  • 2A Parker. The True Picture Of Peer-to-Peer File Sharing [EB/OL]. 2004 [2007-08-01]. http://www.cachelogic. com.
  • 3Ng T S E, Zhang H. Predicting intemet network distance with Coordinates - based Approaches[ C]// Proceedings of INFOCOM' 2002. New York, USA, 2002 : 170 - 179.
  • 4Dabek F, Cox F, Kaashoek F, et al. Vivaldi: a decentralized network coordinate system [ C ] // Proceedings of ACM SIGCOMM' 2004. Portland, USA, 2004:631 - 637.
  • 5CHEN Y, XIONG Y, SHI X, et al. Pharos: a decentralized and hierarchical network coordinate system for intemet distance prediction [C]// Proceedings of GLOBECOM' 2007. Washington D C, USA, 2007.
  • 6Bindal R, Cao P, Chan W. Improving traffic locality in BitTorrent via biased neighbor selection [ C ]// Proceedings of ICDCS' 2006. Lisboa, Portugal, 2006 : 66 - 76.
  • 7GT-ITM Website [ EB/OL ]. 2007-08-10. http ://www. cc. gatech.edu/projects/gtitm/.

同被引文献36

  • 1陈阳,邓北星,李星.基于坐标的网络节点聚类在Internet中的实验研究[J].大连理工大学学报,2005,45(z1):41-43. 被引量:3
  • 2张永铮,方滨兴,迟悦,云晓春.网络风险评估中网络节点关联性的研究[J].计算机学报,2007,30(2):234-240. 被引量:52
  • 3陈桂生,李德毅.基于数据场的复杂网络级联失效传播模型[C]//全国复杂网络学术会议.2006
  • 4Hoffman J. Multi-Tracker Website [EB/OL]. (2008-08-5). http: //wiki. Depthstrike. corn/index, php/P2P: Protocol: Specifications : Multitracker.
  • 5Cohen B. BitTorrent Website [EB/OL]. (2008-08-5). http: //www. bittorrent, com.
  • 6Parker A. The True Picture Of Peer-to-Peer File Sharing [EB/OL]. (2008-08-05). http: //www. cachelogic, com.
  • 7Neglia G, Reina G, Zhang Honggang, et al. Availability in BitTorrent Systems [C]//IEEE Infocom, USA, 2007: 2216 - 2224.
  • 8Pietzuch P, Ledlie J, Mitzenmacher M, et al. Network-Aware Overlays with Network Coordinates [C]// International Workshop on Dynamic Distributed Systems, Lisbon, Portugal, 2006: 12-12.
  • 9Dabek F, Cox R, Kaashoek F, et al. Vivaldi: A decentralized network coordinate system [J]. ACM SIGCOMM Computer Communication Review, 2004, 34(4) : 15 - 26.
  • 10Ledlie J, Gardner P, Seltzer M. Network Coordinates in the Wild [C]//NSDI '07. Cambridge, MA, 2007:299-311.

引证文献5

二级引证文献9

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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