基于网络覆盖的P2P稀有资源搜索策略  

Rare Peer-to-Peer Resource Searching Strategy Based on Network Cover

作　　者：田舟贤[1,2] 顾乃杰[1,2] 何颂颂[1,2] 

机构地区：[1]中国科学技术大学计算机科学与技术系,合肥230027 [2]安徽省计算与通信软件重点实验室,合肥230027

出　　处：《计算机工程》2009年第11期68-70,共3页Computer Engineering

基　　金：国家自然科学基金资助重点项目(60533020);教育部博士点基金资助项目(20060358011)

摘　　要：针对无结构P2P网络中稀有资源搜索成功率低、搜索代价高的问题,提出2种基于网络覆盖的稀有资源搜索策略:RSR和FRSR。RSR在随机漫步的基础上通过考虑邻居节点的热度改进请求转发方式,FRSR通过结合洪泛搜索改进随机漫步转发策略。实验结果表明,RSR搜索稀有资源的时间比普通随机漫步减少了22.9%,平均搜索成功率提高了26.2%,通信开销降低了22.8%,FRSR比随机转发方式减少了15.4%的搜索时间,提高了14.2%的搜索成功率。Aiming at the problem that locating rare resource is time-consuming with low success rate in unstructured P2P networks, this paper proposes two strategies for rare resource searching： Random Search for Rare resource（RSR） and Flooding and Random Search for Rare resource（FRSR）. Based on random walk, RSR modifies request-forward manner by taking the popularity of neighbor nodes into consideration on passing searching request. FRSR combines flooding search with random walk. Simulations show that compared with Random Walk, RSR can reduce response time and communication cost by 22.9% and 22.8%, and improves success rate by 26.2%. Compared with random request passing method, FRSR reduces the response time by 15.4% and improves success rate by 14.2%.

关 键 词：网络覆盖 稀有资源 无结构P2P网络 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]