位置:成果数据库 > 期刊 > 期刊详情页
基于重复博弈的P2P网络信用管理机制的研究
  • ISSN号:1000-1239
  • 期刊名称:《计算机研究与发展》
  • 时间:0
  • 分类:TP393[自动化与计算机技术—计算机应用技术;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]东南大学计算机网络和信息集成教育部重点实验室,南京210096, [2]东南大学计算机科学与工程系,南京210096
  • 相关基金:国家“九七三”重点基础研究发展规划基金项目(2003CB314801);国家自然科学基金项目(60573133)This paper is supported by the National Grand Fundamental Research 973 Program of China under grant No. 2003CB314801 and the National Natural Science Foundation of China Under grant No. 60573133. P2P networks have risen to prominence in the distributed systems community, owing to their advantages in self-organization property and scalability over traditional client-server architectures. However, the self-organizing management mode in P2P networks leads to a large amount of selfish behaviors among peers, and the local views of the peers makes the corresponding trust model hard to establish. Authors' studies mainly focus on this challenge and try to resolve it. Most of the proposed solutions use the flooding mechanism to learn historical behavior information of other peers, which causes excessive incurred packets, and thus limits the dynamic scalability. We developed a novel trust model named RGTrust based on repeated game theory to stimulate rational peers to maximize their own utility and contribute their free resource. Under the assumption that individual peers are rational and selfish, P2P networks using RGTrust scheme have a good performance and stability. Furthermore, compared with other types of trust model, RGTrust yields both lower time complexity and fewer incurred packets. The relative distributed algorithm can easily be deployed to punish non-cooperating peers in a P2P networks and satisfied with self-organization and scalability.
中文摘要:

自组织特性是P2P网络的基本特征之一,管理模式的自组织使得与之相适应的安全模型难以建立,当前基于节点全局信用度模型的分布式算法存在时间复杂度高、报文通信量大等不足,因而对其所能应用的P2P网络的规模存在限制.提出一种基于非合作重复博弈理论的信用管理模型RGTrust,在P2P网络参与节点是理性且自私的假设条件下,从理论和实验两方面说明了应用RGTrust信用模型方案的P2P网络具有良好的稳定性及整体性能的最优性,并且信用计算的时间复杂度及报文通信量远低于其他信用模型。

英文摘要:

Self-organization is a fundamental property of P2P networks. The local views of the nodes which are managed in self-organization mode make the corresponding trust model hard to establish. Current trust models based on global reputation by using the iterative method have high time complexity and excessive incurred packets, thus limiting the scalability when applied to P2P networks. A novel trust model, named RGTrust, based on repeated game theory is given in the paper. Under the assumption that individual peers are rational and selfish, the mechanism of RGTrust is described in details. P2P networks using RGTrust scheme have a good performance and stability. Furthermore, compared with other types of trust model, RGTrust yields both lower time complexity and fewer incurred packets. Simulations have also verified the conclusion.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《计算机研究与发展》
  • 中国科技核心期刊
  • 主管单位:中国科学院
  • 主办单位:中国科学院计算技术研究所
  • 主编:徐志伟
  • 地址:北京市科学院南路6号中科院计算所
  • 邮编:100190
  • 邮箱:crad@ict.ac.cn
  • 电话:010-62620696 62600350
  • 国际标准刊号:ISSN:1000-1239
  • 国内统一刊号:ISSN:11-1777/TP
  • 邮发代号:2-654
  • 获奖情况:
  • 2001-2007百种中国杰出学术期刊,2008中国精品科...,中国期刊方阵“双效”期刊
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,荷兰文摘与引文数据库,美国工程索引,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:40349