| 一个有效的对等网络搜索机制 |
| |
| 引用本文： | 李振武,杨舰,石明宏,白英彩. 一个有效的对等网络搜索机制[J]. 上海交通大学学报, 2004, 38(1): 91-95 |
| |
| 作者姓名： | 李振武 杨舰 石明宏 白英彩 |
| |
| 作者单位： | 上海交通大学,计算机科学与工程系,上海,200030;复旦大学,计算机科学与工程系,上海,200433 |
| |
| 摘 要： | 提出了一个对等网络中基于“簇”的搜索机制,利用信息社会中数据的存放具有结构化的特点,设计了一个算法在具有相似“兴趣”的Peer之间建立邻居关系,形成一个“簇”．转发查询请求时优先考虑“兴趣”更接近的簇内的Peer,大大提高了搜索效率,同时保持了非结构化系统的良好的容错性且支持关键字部分匹配．
|
| 关 键 词： | 对等网络 簇 叠加 结构化 请求路径长度 |
| 文章编号： | 1006-2467(2004)01-0091-05 |
| 修稿时间： | 2003-01-16 |
An Efficient Search Scheme in Peer-to-Peer Network |
| |
| LI Zhen-wu,YANG Jian,SHI Ming-hong,BAI Ying-cai. An Efficient Search Scheme in Peer-to-Peer Network[J]. Journal of Shanghai Jiaotong University, 2004, 38(1): 91-95 |
| |
| Authors: | LI Zhen-wu YANG Jian SHI Ming-hong BAI Ying-cai |
| |
| Affiliation: | LI Zhen-wu~1,YANG Jian~2,SHI Ming-hong~1,BAI Ying-cai~1 |
| |
| Abstract: | This paper presented a "cluster" based search scheme in peer-to-peer netowrk. Its idea is based on the fact that data distribution in information society has a structured feature. An algorithm was designed to cluster the peers that have similar interests. When receiving a query request, a peer is preferentially forwards to the peer that is in the same cluster and has more similarities. Through this scheme the search efficiency is remarkably improved, meanwhile a good resilience to peer failure is reserved. Partial-match queries are supported either. |
| |
| Keywords: | peer-to-peer network cluster overlay structured request pathlength |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
