北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2008, Vol. 31 ›› Issue (2): 42-45.doi: 10.13190/jbupt.200802.42.guanzht

• 论文 • 上一篇    下一篇

混合对等网络中基于激励的可靠搜索算法

关志涛1,2,曹元大2,李 剑3   

  1. 1.华北电力大学 计算机系, 北京112206; 2. 北京理工大学 计算机科学与技术学院, 北京100081; 北京邮电大学 网络与交换技术国家重点实验室信息安全中心, 北京100876
  • 收稿日期:2007-07-18 修回日期:1900-01-01 出版日期:2008-04-28 发布日期:2008-04-28
  • 通讯作者: 关志涛

Incentive-Based Search Algorithm in Hybrid Peer-to-Peer Networks

GUAN Zhi-tao1, 2, CAO Yuan-da2, LI Jian3   

  1. 1. Department of Computer, North China Electric Power University, Beijing 112206, China; 2. School of Computer Science and Technology, Beijing Institute of Technology, Beijing 100081, China; 3. Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2007-07-18 Revised:1900-01-01 Online:2008-04-28 Published:2008-04-28
  • Contact: GUAN Zhi-tao

摘要:

针对对等网络中因搭便车节点的消极行为所造成的搜索不可靠问题,提出了基于信度模型的可靠搜索算法(CMRRW)。应用信度模型来评价节点的服务能力和稳定性。提出查询可靠率的概念,用来反映经由该节点的历史查询成功率及其周边环境路由效率。在节点选择邻居进行消息转发时,优先选择信度高且历史命中率高的邻居节点。实验结果表明,CMRRW算法能显著提高搜索效率,提高搜索的可靠性。

关键词: 对等网络, 随机漫步, 激励机制, 搜索

Abstract:

In peer-to-peer network, there exist lots of free riders, whose passive behaviors decrease the efficiency and reliability of search. A new search algorithm named credit model based restricted random walk (CMRRW), which is based on the credit model, is proposed to solve this problem. The credit model is applied to evaluate the reliability of the peers. The query reliability rate is gained to reflect the peer’s history query success rate and the routing efficiency of its neighbors. In our solutions, when the peer selects neighbors to forward the query message, the neighbors with higher credit and history hit rate will be selected in prior order. Simulation results indicate that CMRRW shows good performance.

Key words: peer-to-peer network, random walk, incentive mechanism, search

中图分类号: