节点文献
使用兴趣子网划分算法对Gnutella中资源定位机制的改进
Research of Using Interest-Subnet Grouping Algorithm and Improvement on Content Location of Gnutella
【摘要】 Gnutella是一种对等网络文件共享应用,使用"洪泛"算法进行资源定位,具有简单、容错的特点,但扩展性差.提出一种基于兴趣本体模型对用户兴趣进行建模,通过将具有相似兴趣的节点建立直接连接构成兴趣子网,从而有效地避免在Gnutella中使用广播扩散方式进行资源定位,以提高Gnutella的可扩展性和内容定位性能.仿真实验证明了兴趣子网模型是有效的.
【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.
【Key words】 interest-subnet; ontology; Gnutella network; content location;
- 【文献出处】 上海交通大学学报 ,Journal of Shanghai Jiaotong University , 编辑部邮箱 ,2004年12期
- 【分类号】TP393
- 【被引频次】18
- 【下载频次】130