一种新的P2P资源共享激励机制

被引:3
作者
侯孟书
卢显良
王涛
任立勇
机构
[1] 电子科技大学计算机科学与工程学院,电子科技大学计算机科学与工程学院,电子科技大学计算机科学与工程学院,电子科技大学计算机科学与工程学院四川成都,四川成都,四川成都,四川成都
关键词
存储分配; 对等计算; 激励; 动态规划; 协同作弊;
D O I
10.15961/j.jsuese.2005.03.022
中图分类号
TP393.02 [];
学科分类号
081201 ; 1201 ;
摘要
针对P2P系统中共享存储资源的搭便车和公共悲剧问题,提出了一种针对存储资源分配的激励机制。节点根据请求者的贡献值分配其资源,以使其获得最大收益,采用P grid存储节点的贡献值,并且分析了该激励机制涉及的安全问题,仿真实验表明,该激励机制能有效地实现存储资源分配的公平性和效率,达到了激励节点参与资源共享的目的。
引用
收藏
页码:94 / 98
页数:5
相关论文
共 6 条
[1]  
Robust incentive techniques for peer-to-peer networks. Feldman M,Lai K,Stoica I,et al. Proceedings of the 5th ACM conference on Electronic commerce . 2004
[2]  
Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility. Rowstron A,Druschel P. Proceedings of the 18th ACM Symposium on Operating Systems Principles . 2001
[3]  
Pastiche: making backup cheap and easy. Cox L P,Murray C D,Noble B D. Proceedings of the 5th Symposium on Operating Systems Design and Implementation . 2002
[4]  
Fileteller: paying and getting paid for file storage. Ioannidis J,Ioannidis S,Keromytis A D,et al. Proceedings of the Sixth Annual Conference on Financial Cryptography . 2002
[5]  
Incentives for sharing in 1peer-to-peer networks. Golle P,Leyton-Brown K,Mironov I,et al. Proceedings of the ACM Conference on Electronic Commerce . 2001
[6]  
Distributed algorithmic mechanism design: recent results and future directions. Feigenbaum J,Shenker S. Proceedings of the Discrete Algorithms and Methods for Mobile Computing and Communications . 2002