| 一种面向大规模P2P系统的快速搜索算法 |
| |
| 引用本文： | 张一鸣,卢锡城,郑倩冰,李东升.一种面向大规模P2P系统的快速搜索算法[J].软件学报,2008,19(6):1473-1480. |
| |
| 作者姓名： | 张一鸣 卢锡城 郑倩冰 李东升 |
| |
| 作者单位： | 国防科学技术大学,并行与分布处理国家重点实验室,湖南,长沙,410073 |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China under Grant Nos.60673167, 60703072 (国家自然科学基金); the National Basic Research Program of China under Grant No.2005CB321801 (国家重点基础研究发展计划(973)) |
| |
| 摘 要： | 提出一种面向大规模P2P系统的概率搜索小组(probabilistic search team,简称PST)算法.各节点首先发布本节点的资源共享信息,并基于分布式丢弃Bloom Filter技术(distributed discarding bloom filter,简称DDBF)对从其他节点收到的信息进行保存和转发PST算法把RW算法中漫步者的概念扩充为搜索小组通过聚合各小组在搜索过程中获得的资源信息,PST算法实现了多个小组之间相互协同的并行搜索.分析模拟结果表明,PST算法在保持低定位开销的同时取得了较好的定位性能.
|
| 关 键 词： | 概率搜索小组 分布式丢弃Bloom Filter 搜索方向 搜索强度 虚拟计算环境 |
| 收稿时间： | 2006/7/10 0:00:00 |
| 修稿时间： | 2006年7月10日 |
An Efficient Search Algorithm for Large-Scale P2P Systems |
| |
| ZHANG Yi-Ming,LU Xi-Cheng,ZHENG Qian-Bing and LI Dong-Sheng.An Efficient Search Algorithm for Large-Scale P2P Systems[J].Journal of Software,2008,19(6):1473-1480. |
| |
| Authors: | ZHANG Yi-Ming LU Xi-Cheng ZHENG Qian-Bing and LI Dong-Sheng |
| |
| Abstract: | This paper presents a search algorithm called probabilistic search team(PST).In PST,all nodes advertise their resource sharing information,maintain and broadcast the information based on DDBF(distributed discarding bloom filter),which discards some information when transmitted to their neighbors.During the search process,PST extends the concept of walker in RW to search team.PST realizes collaborative and parallel search of multiple search teams by aggregating the resource information obtained in search process.Experimental results show that PST achieves a good tradeoff between performance and overhead. |
| |
| Keywords: | probabilistic search team distributed discarding Bloom filter search direction search intensity iVCE |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
