首页> 外文会议>International symposium on instrumentation and control technology >Game theoretic analyses for free-riding and whitewashing in P2P systems
【24h】

Game theoretic analyses for free-riding and whitewashing in P2P systems

机译:P2P系统中的搭便车和洗白的博弈论分析

获取原文
获取外文期刊封面目录资料

摘要

Conventional P2P networks do not provide incentives for users. Therefore, users can easily obtain information without themselves contributing any information or service to a P2P community. This leads to the well known free-riding problem. Reputation systems may impose penalties on free-riders to identify and distinguish them from contributors, but these systems are vulnerable to the whitewashing attack. This paper analyzed the Tit-for-Tat protocol in the presence of whitewashers using a game theoretic approach. The Tit-for-Tat protocol is not an evolutionary stable strategy against invasion of whitewashing, but imposing an appropriate identity cost helps in preventing invasion by whitewashers. Simulation results demonstrated the theoretic analysis, and showed that the percentage of cooperating nodes in P2P networks with an appropriate identity cost is nearly four times bigger than without any identity cost.
机译:传统的P2P网络无法为用户提供激励。因此,用户可以轻松获得信息,而无需自己向P2P社区提供任何信息或服务。这导致了众所周知的搭便车问题。信誉系统可能会对搭便车者施加惩罚,以识别出他们并将其与贡献者区分开来,但是这些系统很容易遭受粉饰攻击。本文使用博弈论方法对存在清洗剂的Tit-for-Tat协议进行了分析。 Tit-for-Tat协议不是针对粉饰入侵的进化稳定策略,但是施加适当的身份成本有助于防止粉饰入侵。仿真结果证实了理论分析,并表明具有适当标识成本的P2P网络中协作节点的百分比几乎是没有任何标识成本的协作节点的四倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号