期刊文献+

基于主题划分的有组织P2P搜索算法 被引量:15

Distributed Information Search Based on Topic Partition in Structured Peer-to-Peer Networks
下载PDF
导出
摘要 提出一种基于主题划分的P2P搜索算法———主题覆盖网络搜索算法(TONS).TONS在有组织P2P网络基础上,将结点按主题组织成覆盖网络,使含有相似主题的结点链接在一起,因此可以根据内容将查询限定在P2P网络的局部范围内.通过在覆盖网络中随机添加一些长距离链接,使覆盖网络具有Small-World特性.TONS为有组织的P2P系统提供了一种能依据部分匹配、多关键词等复杂条件搜索结点数据对象的有效方法,与现有的有组织P2P系统相比,它可以将搜索的查全率提高74.7%,并减少P2P网络信息搜索的平均路径距离和平均消息数目. A topic overlay network search (TONS) algorithm, P2P search mechanism based on topic partition, is presented. On the basis of the structured networks, the nodes are organized as an overlay network according to topics such that the nodes containing similar topic are linked together. Thus, the query contents can be limited in the local range of P2P network and the overlay network has small world traits by randomly adding some long distance links in the overlay network. TONS provides structured P2P networks with effective approach to search for node data objects based on complicated queries with partial match and multiple keywords. Compared with the existing structured systems, TONS increases the search recall by 74. 7%, and reduces the average oath distance and the average number of messages during the searching process.
出处 《西安交通大学学报》 EI CAS CSCD 北大核心 2005年第12期1327-1330,共4页 Journal of Xi'an Jiaotong University
基金 国家高技术研究发展计划资助项目(2003AA1Z2610)
关键词 主题覆盖网络 主题划分 信息搜索 有组织P2P网络 topic overlay network topic partition information search structured P2P network
  • 相关文献

参考文献10

  • 1Stoica I, Morris R, Karger D, et al. Chord: a scalable peer-to-peer lookup service for Internet applications [A]. ACM SIGCOMM Conference, San Diego, USA, 2001.
  • 2Ratnasamy S, Francis P, Handley M, et al. A scalable content-addressable network [A]. ACM SIGCOMM Conference, San Diego, USA, 2001.
  • 3Rowstron A, Druschel P. Pastry: scalable, distributed object location and routing for large-scale peer-to-peer systems [A]. IFIP/ACM International Conference on Distributed Systems Platforms. Heidelberg, Germany, 2001.
  • 4Manku G S, Bawa M, Raghavan P. Symphony: distributed hashing in small world [A]. 4th USENIX Symposium on Internet Technologies and Systems, Seattle, USA,2003.
  • 5Zhou F, Zhuang L, Zhao B Y, et al. Approximate object location and spam filtering on peer-to-peer systems [A]. ACM/IFIP/USENIX International Middleware Conference, Rio de Janeiro, Brazil,2003.
  • 6Reynolds P, Vahdat A. Efficient peer-to-peer keyword searching [A]. ACM/IFIP/USENIX International Middleware Conference, Rio de Janerio, Brazil, 2003.
  • 7Tang C Q, Xu Z C, Dwarkadas S. Peer-to-peer information retrieval using self-organizing semantic overlay networks [A]. ACM SIGCOMM Conference, Karlsruhe, Germany,2003.
  • 8Daswani N, Garcia-Molina H, Yang B. Open problems in data-sharing peer-to-peer systems [A]. 9th International Conference on Database Theory, Siena, Italy,2003.
  • 9Watts D J, Strogatz S H. Collective dynamics of small world-world networks [J]. Nature,1998,393(6684):440-442.
  • 10Kleinberg J. The small-world phenomenon: an algorithmic perspective [A]. 32nd ACM Symposium on Theory of Computing, Portland,USA,2000.

同被引文献123

引证文献15

二级引证文献31

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部