基于社交网络的P2P内容分发算法研究  

Exploiting Online Social Networks to Accelerate Peer-Assisted Content Distribution

作　　者：吴迪[1] 陈必盛[1] 黄健[1] 梁懿[1] 

机构地区：[1]中山大学信息科学与技术学院,广州510006

出　　处：《系统仿真学报》2013年第12期2840-2844,共5页Journal of System Simulation

基　　金：国家自然科学基金(61003242;61272397);广东省自然科学杰出青年基金(S20120011187);教育部新世纪优秀人才支持计划(NCET-11-0542);广州市珠江科技新星专项计划(2011J2200086);教育部博士点基金(20100171120047)

摘　　要：随着互联网社交网络应用的流行,基于社交网络的P2P应用也渐渐涌现。社交网络的最大特点是网络中的节点是建立在真实的社交关系之上。BitTorrent作为P2P文件共享的典型应用,为了限制和惩罚系统中节点的"搭便车"行为,引入了一种Tit-for-Tat的阻塞机制,该机制有效地限制了系统中节点的"搭便车"行为。但与此同时,TFT阻塞机制也限制系统整体性能的提高。提出了一种基于社交网络的自适应阻塞算法来解决上述问题,并利用仿真实验证实改进后的算法比传统的基于TFT的阻塞算法能有效地降低系统的平均启动延迟时间和下载完成时间。With the popularity of online social networks （OSN）, the P2P application built on the social network is emerging in recent years. The unique feature of online social networks is that nodes in the online social network are associated with people in the real world. BitTorrent, as a typical P2P content delivery application, introduces a ＂Tit-for-Tat＂ （TFT） mechanism to limit free riding. TFT mechanism can effectively prevent nodes from acting as a ＂free rider＂. But at the same time, it also limits the distribution efficiency of the whole system. In order to solve the problem that TFT mechanism hindered nodes from more efficient cooperation, an adaptive chocking algorithm was proposed based on the online social network, and the simulation experiments confirmed that the proposed algorithm can effectively reduce the average startup time delay and download completion time compared with the traditional TFT-based algorithm.

关 键 词：P2P 内容分发 社交网络 Tit—for-Tat阻塞机制 自适应阻塞算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]