English

应用科学学报

• 通信工程 • 上一篇    下一篇

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

王浩云; 张顺颐; 孙雁飞; 李君
  

  1. 南京邮电大学江苏省通信与网络技术工程研究中心，南京210003
  • 收稿日期:2008-09-01 修回日期:2008-10-14 出版日期:2009-01-25 发布日期:2009-01-25
  • 通信作者: 王浩云

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

WANG Hao-yun; ZHANG Shun-yi; SUN Yan-fei; LI Jun   

  1. Jiangsu Province Engineering Research Center of Telecommunication & Network Technology,Nanjing University of Posts and Telecommunications, Nanjing 210003, China
  • Received:2008-09-01 Revised:2008-10-14 Online:2009-01-25 Published:2009-01-25
  • Contact: WANG Hao-yun

PDF

1450

被引次数

4

摘要： 现有P2P网络节点博弈模型未考虑节点类型的多样性、节点策略的复杂性以及节点信息的不对称性. 针对这一问题，该文提出一种新型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.

Key words: peer-to-peer network, routing node, type, combined strategy, game model

中图分类号: