期刊文献+

语义对等网覆盖路由模型的研究 被引量:3

Research on Semantic Peer-to-peer Overlay Route Model
下载PDF
导出
摘要 现有对等网覆盖路由模型只适应精确查找,存在不支持语义查询的缺点。该文通过建立语义空间,根据所存储数据对象的兴趣来聚集节点,实现支持语义的对等网络路由模型,提高了搜索效率。仿真实验结果表明,该模型的搜索性能优于原有模型。 Peer-to-peer overlay route model is able to query accurately, but does not sustain semantic query. This paper clusters noaes according to their data interests by forming semantic space, and designs an improved semantic peer-to-peer route model to enhance file query efficiency. Simulating experimental results show that the improved model has better performance.
作者 朱晓姝
出处 《计算机工程》 CAS CSCD 北大核心 2008年第13期110-112,共3页 Computer Engineering
基金 广西省自然科学青年基金资助项目(桂科青0832101)
关键词 对等网络 语义覆盖网 节点聚集 搜索效率 peer-to-peer semantic overlay network node clustering query efficiency
  • 相关文献

参考文献7

  • 1Schlosser M, Sintek M, Decker S, et al. A Scalable and Ontology-based P2P Infrastructure for Semantic Web Services[C]//Proceedings of the 2nd IEEE International Conference on Peer-to-Peer Computing. [S. l.]: IEEE Press, 2002.
  • 2Stephanos R T, Spinellis D. A Survey of Peer-to-Peer Content Distribution Technologies[J]. ACM Computing Surveys, 2004, 36(4): 335-371.
  • 3朱晓姝,周娅,黄桂敏.基于小世界层次分布式路由模型研究[J].计算机工程,2006,32(15):120-122. 被引量:7
  • 4杨舰,吕智慧,钟亦平,张世永.一种基于兴趣域的高效对等网络搜索方案[J].计算机研究与发展,2005,42(5):804-809. 被引量:24
  • 5Kleinberg J. Navigation in a Small World[J]. Nature, 2000, (406): 845-847.
  • 6Zhang Tian, Ramakrishnan R, Livny M. Birch: An Efficient Data Clustering Method for Very Large Databases[C]//Proceedings of ACM SIGMOD Int'l Conf. on Management of Data. [S. l.]: ACM Press, 1999.
  • 7Berry M W, Drmac Z, Jessup E R. Matrices, Vector Spaces, and Information Retrieval[J]. Society for Industrial and Applied Mathematics Review, 1999, 41 (2): 335-362.

二级参考文献26

  • 1乐光学,李仁发,周祖德.基于Region多层结构P2P计算网络模型[J].软件学报,2005,16(6):1140-1150. 被引量:22
  • 2L. Gong. Peer-to-peer networks in action. IEEE Internet Computing, 2002, 6(1): 37~39.
  • 3Napster Inc. Napster website. http: // www.napster.com/,2003-10-08.
  • 4S. Ratnasamy, P. Francis, M. Handley, et al. A scalable content-addressable network. ACM SIGCOMM 2001, San Diego,USA, 2001.
  • 5I. Stoica, R. Morris, D. Karger, et al. Chord: A scalable peerto-peer lookup service for Internet applications. ACM SIGCOMM 2001, San Diego, USA, 2001.
  • 6A. Rowstron, P. Druschel. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems. In: Proc.the 18th IFIP/ACM Int'l Conf. Distributed Systems Platforms.Heidelberg: Springer-Verlag, 2001. 329~350.
  • 7B. Zhao, J. Kubiatowicz, A. Joseph. Tapestry: An infrastructure for wide-area fault-tolerant location and routing. U.C. Berkeley, Tech. Rep.: UCB/CSD-01-1141, 2001.
  • 8Open Source Community. Gnutella website. http: //gnutella.wego.com/, 2003-10-10.
  • 9K. Sripanidkulchai, B. Maggs, H. Zhang. Efficient content location using Interest-based locality in peer-to-peer systems.IEEE Infocom 2003, San Francisco, USA, 2003.
  • 10FastTrack P2P Technology Company. FastTrack website. http://www.fasttrack.nu/, 2003-10-12.

共引文献28

同被引文献8

引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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