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

A "cluster" based search scheme in peer-to-peer network
作者姓名:Li ZW  Yang J  Shi XD  Bai YC
作者单位:[1]DepartmentofComputerScienceandEngineering,ShanghaiJiaotongUniversity,Shanghai200030,China [2]DepartmentofComputerScienceandEngineering,FudanUniversity,Shanghai200433,China
摘    要:This paper presents a “cluster“ based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.

关 键 词:计算机网络  对等网络  网络结构  请求通路长度  聚类  搜索策略

A "cluster" based search scheme in peer-to-peer network
Li ZW,Yang J,Shi XD,Bai YC.A "cluster" based search scheme in peer-to-peer network[J].Journal of Zhejiang University Science,2003,4(5):549-554.
Authors:Li Zhen-wu  Yang Jian  Shi Xu-dong  Bai Ying-cai
Institution:Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030, China. li-zw@cs.sjtu.edu.cn
Abstract:This paper presents a "cluster" based search scheme in peer-to-peer network. The idea is based on the fact that data distribution in an information society has structured feature. We designed an algorithm to cluster peers that have similar interests. When receiving a query request, a peer will preferentially forward it to another peer which belongs to the same cluster and shares more similar interests. By this way search efficiency will be remarkably improved and at the same time good resilience against peer failure (the ability to withstand peer failure) is reserved.
Keywords:
本文献已被 维普 PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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