P2P网络中搭便车行为研究  

Survey:Free Riding in P2P Network

作　　者：刘建生[1] 骆丹[1,2] 乐光学[2] 李明明[1,2] 陆春龙[3] 

机构地区：[1]江西理工大学理学院,江西赣州341000 [2]嘉兴学院数理与信息工程学院,浙江嘉兴314000 [3]常州大学石油工程学院,江苏常州213016

出　　处：《数学的实践与认识》2014年第7期196-209,共14页Mathematics in Practice and Theory

基　　金：浙江省自然科学基金(LY12F02019);浙江省公益技术应用研究项目(2011C23130);浙江省嘉兴市科技计划项目(2012AY1027)

摘　　要：搭便车现象是P2P网络中普遍存在的问题,当网络中存在大量的搭便车节点时,会导致网络拥塞,降低网络性能,甚至导致整个系统崩溃.对目前主要的搭便车行为进行统计,分析搭便车行为产生的机理以及对网络造成的影响.从信任机制、激励机制、演化博弈和效用4个方面对搭便车行为抑制策略进行研究分析,并通过仿真实验对经典算法进行验证.最后对搭便车行为抑制机制的未来研究方向进行展望.Since the first report of Eytan Adar and Bernardo A. Huberman aboat free riding,a large amounts of surveys results show that free riding is a common phenomenon in today＇s network. When hitchhiking there are a large number of free riders in the network, and can lead to network congestion, slow network performance and even cause the entire system to crash. Statistics for current major researches, analyze the mechanism of free riding behavior, as well as the impact on the network. From the four of trust mechanisms, incentives, evolutionary game theory and utility, research and analyse how to overcome free riding behavior. Finally, the prospects of mechanism to inhibite free riding are outlined.

关 键 词：P2P 搭便车 信任机制 激励机制 演化博弈 效用 

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