中国邮电高校学报(英文) ›› 2010, Vol. 17 ›› Issue (5): 64-71.doi: 10.1016/S1005-8885(09)60509-4

• Networks • 上一篇    下一篇

SKIP: an efficient search mechanism in unstructured P2P networks

申文武1,双锴3,苏森2,杨放春2   

  1. 1. 北京邮电大学网络技术研究院国家重点实验室交换与智能控制技术中心
    2. 北京邮电大学网络与交换技术国家重点实验室
    3. 北京邮电大学
  • 收稿日期:2010-01-29 修回日期:2010-05-17 出版日期:2010-10-30 发布日期:2010-10-31
  • 通讯作者: 申文武 E-mail:sky3290@gmail.com

SKIP: an efficient search mechanism in unstructured P2P networks

  1. State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2010-01-29 Revised:2010-05-17 Online:2010-10-30 Published:2010-10-31

摘要:

Search efficiency and accuracy of resource are important considerations for search algorithm in peer-to-peer (P2P) network. Most search algorithms use flooding among neighbor nodes to search relevant resource. However, this usually causes great amount of redundant messages, which results in high search costs and low search precision. In this paper, we use vector space model (VSM) and relevance ranking algorithms to construct overlay network, and a novel search mechanism search with K-iteration preference (SKIP) based on semantic group for P2P networks is proposed to efficiently solve these problems. The key idea of SKIP is to reorder the semantic neighbors of nodes according to relevant scores and to utilize preference selection during the process of query. We analysis and implement the scheme and reveal that the SKIP provides a low overhead on topology maintenance, which can be effectively used in P2P searching and verify it outperformance in higher precision and lower search cost by comparing with current semantic-based searching mechanism gnutella-like efficient searching system (GES).

关键词:

K-iteration, preference, SKIP, P2P networks

Abstract:

Search efficiency and accuracy of resource are important considerations for search algorithm in peer-to-peer (P2P) network. Most search algorithms use flooding among neighbor nodes to search relevant resource. However, this usually causes great amount of redundant messages, which results in high search costs and low search precision. In this paper, we use vector space model (VSM) and relevance ranking algorithms to construct overlay network, and a novel search mechanism search with K-iteration preference (SKIP) based on semantic group for P2P networks is proposed to efficiently solve these problems. The key idea of SKIP is to reorder the semantic neighbors of nodes according to relevant scores and to utilize preference selection during the process of query. We analysis and implement the scheme and reveal that the SKIP provides a low overhead on topology maintenance, which can be effectively used in P2P searching and verify it outperformance in higher precision and lower search cost by comparing with current semantic-based searching mechanism gnutella-like efficient searching system (GES).

Key words:

K-iteration, preference, SKIP, P2P networks