首页 | 本学科首页   官方微博 | 高级检索  
     检索      

使用兴趣子网划分算法对Gnutella中资源定位机制的改进
引用本文:薛广涛,贺小箭,贾兆庆,尤晋元,李明禄.使用兴趣子网划分算法对Gnutella中资源定位机制的改进[J].上海交通大学学报,2004,38(12):2108-2111.
作者姓名:薛广涛  贺小箭  贾兆庆  尤晋元  李明禄
作者单位:上海交通大学,计算机科学与工程系,上海,200030
基金项目:国家自然科学基金资助项目(60173033),上海市科委2003重大科技攻关项目(03dz15027)
摘    要:Gnutella是一种对等网络文件共享应用,使用“洪泛”算法进行资源定位,具有简单、容错的特点,但扩展性差.提出一种基于兴趣本体模型对用户兴趣进行建模,通过将具有相似兴趣的节点建立直接连接构成兴趣子网,从而有效地避免在Gnutella中使用广播扩散方式进行资源定位,以提高Gnutella的可扩展性和内容定位性能.仿真实验证明了兴趣子网模型是有效的。

关 键 词:兴趣子网  本体  Gnutella网络  资源定位
文章编号:1006-2467(2004)12-2108-04
修稿时间:2003年12月26

Research of Using Interest-Subnet Grouping Algorithm and Improvement on Content Location of Gnutella
XUE Guang-tao,HE Xiao-jian,JIA Zhao-qing,YOU Jin-yuan,LI Ming-lu.Research of Using Interest-Subnet Grouping Algorithm and Improvement on Content Location of Gnutella[J].Journal of Shanghai Jiaotong University,2004,38(12):2108-2111.
Authors:XUE Guang-tao  HE Xiao-jian  JIA Zhao-qing  YOU Jin-yuan  LI Ming-lu
Abstract:Gnutella, a popular file-sharing application, relies on flooding queries to all peers. Although flooding is simple and robust, it is not scalable. This paper uses an ontology model to represent user's interests. An interest-based group model is used to organize the peers with similar interests into a subnet. The content location solution is on top of the existing Gnutella network. By using the algorithm, called interest-based subnet, a significant amount of flooding can be avoided, making Gnutella a more competitive solution. The extensive simulation results show the effectiveness of the proposed model in peer-to-peer system.
Keywords:interest-subnet  ontology  Gnutella network  content location  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号