首页> 外文会议>2011 International Symposium on Computer Science and Society >Game Theory Analysis for Graded Punishment Mechanism Restraining Free-Riding in P2P Networks
【24h】

Game Theory Analysis for Graded Punishment Mechanism Restraining Free-Riding in P2P Networks

机译:P2P网络中限制惩罚机制搭便车的博弈分析

获取原文

摘要

In recent years, various selfish behaviors of P2Pnetwork nodes have become increasingly severe, and the existence of free-riding, white-washing and the like deteriorates the performance of systems. This paper addresses the free-riding problem in P2P networks, and proposes a novel three-grade-punishment mechanism to restrain free-riding conducts in terms of game theory and reputation management to promote the mutual cooperation. The Nash Equilibrium is proved to be available for the rational nodes with this mechanism in a P2P system. The simulation results indicate that the proposed graded punishment mechanism is effective in restraining free-riding behaviors and improving cooperation between nodes.
机译:近年来,P2P网络节点的各种自私行为变得越来越严重,并且搭便车,洗白等的存在降低了系统的性能。本文针对P2P网络中的搭便车问题,提出了一种新颖的三级惩罚机制,从博弈论和声誉管理的角度限制搭便车行为,以促进相互合作。事实证明,在P2P系统中使用这种机制,纳什均衡可用于有理节点。仿真结果表明,所提出的分级惩罚机制在抑制搭便车行为和改善节点间协作方面是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号