作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (23): 111-113. doi: 10.3969/j.issn.1000-3428.2007.23.038

• 网络与通信 • 上一篇    下一篇

超级节点对等网中的声誉管理

金 瑜1,古志民1,班志杰1,2   

  1. (1. 北京理工大学计算机科学技术学院,北京 100081;2. 内蒙古大学理工学院电子系,呼和浩特 010021)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-12-05 发布日期:2007-12-05

Reputation Management in Super-peer Network

JIN Yu1, GU Zhi-min1, BAN Zhi-jie1,2   

  1. (1. School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081; 2. College of Science and Technology, Inner Mongolia University, Hohhot 010021)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-12-05 Published:2007-12-05

摘要: 对现有P2P文件搜索协议进行扩展,提出了一个适用于超级节点对等网的声誉管理协议——SP2PRep。它将叶子节点的声誉投票集中在超级节点上,声誉查询仅在超级节点间进行,搜索空间小。给出了协议执行步骤和实现的消息格式。分析和仿真表明,与现有对等网中的声誉管理协议相比,SP2PRep减少了带宽消耗,加快了声誉查找速度,提高了平均的服务成功率,达到了同等的投票安全性。

关键词: 对等网, 声誉, 信任, 超级节点, 安全

Abstract: By extending current P2P file searching protocol, this paper proposes SP2PRep, a reputation management protocol suitable for super-peer networks. In SP2PRep, reputation votes of leaves nodes are centralized in supernodes. Only supernodes are responsible for processing reputation queries. Therefore reputation searching space becomes small. The running procedure of SP2PRep protocol is described as well as message format for implementation. Analysis and simulations show that compared with current reputation management protocols in P2P systems, SP2PRep protocol reduces the network cost and improves the efficiency of reputation searching and the average ratio of number of successful transactions to that of total transactions. The security of reputation votes in SP2PRep is equal to that of current protocol in peer-to-peer systems.

Key words: peer-to-peer network, reputation, trust, supernode, security

中图分类号: