...
首页> 外文期刊>Journal of simulation >A dynamic game theory approach to solve the free riding problem in the peer-to-peer networks
【24h】

A dynamic game theory approach to solve the free riding problem in the peer-to-peer networks

机译:解决对等网络中搭便车问题的动态博弈论方法

获取原文
获取原文并翻译 | 示例

摘要

The peer-to-peer (P2P) system has prevailed on the Internet. The old client-server architecture is gradually becoming unable to satisfy users' various requests and deal with the heavy loading of networks. Many applications adopt P2P architecture to provide more flexible and efficient service. However, P2P systems are not flawless. The anarchic property of P2P systems keeps participant behaviour uncontrolled. Thus, the behaviour of free riding occurs. This paper uses game theory to explore what results from free riding, designs a co-opetition framework to solve the free riding problem, and also proposes a fairness index to monitor the efficiency of the whole system. Simulations are used to test co-opetition under different environments.
机译:对等(P2P)系统已在Internet上盛行。旧的客户端-服务器体系结构逐渐变得无法满足用户的各种请求并无法应对繁重的网络负载。许多应用程序采用P2P架构来提供更灵活,更高效的服务。但是,P2P系统并非完美无缺。 P2P系统的无政府性质使参与者的行为不受控制。因此,发生了搭便车的行为。本文运用博弈论来探讨搭便车的结果,设计一个竞合框架来解决搭便车问题,并提出一个公平性指标来监控整个系统的效率。仿真用于测试不同环境下的竞争。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号