一种面向结构化P2P网络的基于闲谈的资源发现方法  

A Gossip-Based Approach for Resource Discovery in Structured Peer-to-Peer Networks

作　　者：邓泽[1] 冯丹[2] 周可[2] 施展[2] 

机构地区：[1]中国地质大学(武汉)计算机学院,湖北武汉430074 [2]华中科技大学计算机科学与技术学院,湖北武汉430074

出　　处：《电子学报》2010年第11期2510-2517,共8页Acta Electronica Sinica

基　　金：国家973重点基础研究发展规划(No.2004CB318201);国家863高技术研究发展计划(No.2009AA01A402)

摘　　要：结构化P2P网络下的多属性资源发现一直是一个公开问题.本文针对当前一种新颖的、优于传统方法的多属性资源发现方法-PIRD,深入分析了其在网络动态变化时可能出现的低查询效率问题,并提出一种解决方法:基于闲谈的PIRD(Gossip-based PIRD,G-PIRD).G-PIRD通过闲谈算法估计网络规模,动态调整资源索引的发布以保证高的查询效率.同时针对G-PIRD可能导致的负载不均衡问题,提出一种基于有界LSH(Bounded LSH,B-LSH)的负载均衡策略.试验证明:G-PIRD能动态适应网络变化,保证高效率的多属性资源发现;以及G-PIRD的负载均衡策略在保证高查询效率的同时,大大地降低了节点的索引负载.Multi-attribute resource discovery in structured Peer-to-Peer（P2P） networks is still an open problem.Recently,a novel and more efficient multi-attribute resource discovery approach than traditional ways — P2P-based Intelligent Resource Discovery（PIRD） has been proposed.However,PIRD may be inefficient under network churns.To address this issue,in this paper,a gossip-based PIRD（G-PIRD） is proposed.G-PIRD employs a gossip algorithm to learn the estimated value of network size and dynamically publishes resource indexes to keep a great efficiency of resource discovery.Meanwhile,a load balancing scheme based on bounded LSH（B-LSH） is proposed to deal with the problem of potential load imbalancing of GPIRD.Extensive experiments show that G-PIRD can adapt well to the changes of network size to maintain high query efficiency and the proposed load balancing scheme can greatly reduce the maximum number of indexes per node with the slight loss of query efficiency.

关 键 词：结构化P2P网络 多属性资源发现 闲谈算法 负载均衡 

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