ISSN 1000-1239 CN 11-1777/TP

• 论文 • 上一篇    下一篇

一种基于兴趣域的高效对等网络搜索方案

杨 舰 吕智慧 钟亦平 张世永   

  1. (复旦大学计算机与信息技术系 上海 200433) (young_ship@hotmail.com)
  • 出版日期: 2005-05-15

A Domain of Interest Based Novel Search Scheme in P2P Networks

Yang Jian, Lü Zhihui, Zhong Yiping, and Zhang Shiyong   

  1. (Department of Computing and Information Technology, Fudan University, Shanghai 200433)
  • Online: 2005-05-15

摘要: 为了改进无结构对等网络中搜索效率低下的问题,提出了一种基于兴趣域的高效搜索方案. 和常用的随机搜索方案不同,在所提方案中,文档属性由元数据通过RDF语句描述,拥有相 同元数据的节点同属一个兴趣域,搜索请求首先在兴趣域中传播,大大提高了搜索效率.随 着搜索过程的进行,节点对兴趣域内其他节点了解越多其搜索效率也越高.通过元数据选择 窗口和元数据复制机制,可以进一步提高搜索效率.模拟实验结果证实了所提方案在无结构 对等网络中的准确和高效.

关键词: 对等网络, 兴趣域, 元数据, 搜索

Abstract: A novel search scheme is proposed to address the efficiency and scalability issu es in unstructured peer-to-peer networks. Unlike the notorious search scheme of flooding in unstructured peer-to-peer networks, the proposed scheme is based on the domain of interest that is formed by nodes sharing the same interest. Search request is propagated within the domain of interest, and the efficiency of sear ch process is very high after nodes in the same domain of interest get familiar with one another. In the proposed scheme, attributes of document are described b y metadata using RDF statements to support flexible queries; nodes having the sa me metadata belong to the same domain of interest. With the facility of metadata selection window and metadata replication, performance of the proposed search s cheme is further improved. Simulation results prove the effectiveness and efficiency of the proposed scheme.

Key words: peer-to-peer network, domain of interest, metadata, search