节点文献

P2P网络路由节点组合策略博弈模型

A Game Model of Combination Strategy for Routing Nodes in P2P Networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王浩云张顺颐孙雁飞李君

【Author】 WANG Hao-yun,ZHANG Shun-yi,SUN Yan-fei,LI Jun Jiangsu Province Engineering Research Center of Telecommunication & Network Technology, Nanjing University of Posts and Telecommunications,Nanjing 210003,China

【机构】 南京邮电大学江苏省通信与网络技术工程研究中心

【摘要】 现有P2P网络节点博弈模型未考虑节点类型的多样性、节点策略的复杂性以及节点信息的不对称性。针对这一问题,该文提出一种新型P2P网络路由节点的组合策略博弈模型。该模型根据节点的本质将其分为善意和恶意两类,根据节点在路由中的位置分为端节点和中间节点两类。将各类节点在路由各阶段采用的策略进行组合,形成路由节点的组合策略。在此基础上,分析各类路由节点组合策略博弈的收益矩阵,得出不对称信息局面下各类路由节点调整自身组合策略的算法,以及路由节点背叛的条件。

【Abstract】 The existing studies on the game model of P2P nodes do not take into account diversity of nodes types, complexity of node strategies,and asymmetry of node information.This paper presents a game model of combination strategy for routing nodes in P2P networks.In this model,routing nodes are divided into two types,namely good nodes and bad nodes.They are also categorized as end nodes and middle nodes according to their positions in the routing process.The corresponding strategies adopted by each type of nodes at each routing stage are defined as combination strategies of routing nodes.Based on such strategies,this paper analyzes payoff matrixes of the games among various node strategies,and derives transfer conditions of different combination strategies in the game model with asymmetric information and betrayal of routing nodes.

【基金】 国家“863”高技术研究发展计划基金(No.2006AA01Z232);江苏省自然科学基金(No.BK2007603)资助项目
  • 【文献出处】 应用科学学报 ,Journal of Applied Sciences , 编辑部邮箱 ,2009年01期
  • 【分类号】TP393.02
  • 【被引频次】4
  • 【下载频次】138
节点文献中: 

本文链接的文献网络图示:

本文的引文网络