摘要
针对P2P网络中节点共享存储资源时存在的"搭便车"问题,在节点存储资源分配时引入控制机制,节点根据请求者的贡献值分配其存储资源,以使贡献值小的节点获取资源少,从而抑制搭便车行为。仿真实验表明,该控制机制的动态规划算法能有效地实现P2P网络中存储资源分配的公平性,达到控制节点搭便车行为的目的。
As free-riding is so popular in P2P network,this paper proposes incentive mechanism in a P2P storage sharing system based on dynamic programming algorithms.In this mechanism,the provider allocates the resource based on this mechanism,and maximizes its sharing files by the optimum policy.And also the social utility of free-riding is analysed.Analyses and simulations show that the incentive mechanism is fair and effective,and it can discard the free-rider from P2P system effectively so that it can earn more reward.
出处
《计算机工程与应用》
CSCD
北大核心
2010年第1期64-66,115,共4页
Computer Engineering and Applications
基金
国家自然科学基金No.60673163~~
关键词
P2P网络
搭便车
动态规划算法
存储资源
P2P network
free-riding
dynamic programming algorithms
storage resource