P2P-Grid环境中基于流言传播的资源查找方法研究  

Research of resource query based on rumor-spreading in P2P-Grid

作　　者：王瑞锋[1] 刘方爱[1] 

机构地区：[1]山东师范大学计算机科学与工程学院,山东济南250100

出　　处：《计算机工程与设计》2008年第1期56-58,108,共4页Computer Engineering and Design

基　　金：国家自然科学基金项目(90612003)

摘　　要：对两层结构的P2P-Grid网格模型进行了改进,在超级节点层上增加了分类节点层,即选择超级节点中性能较高的节点存放分类信息。给出了基于流言传播机制的分布式资源查找算法,该算法利用流言传播机制具有传播流言的兴趣随着重复收到某个流言而减少的特点,避免某个节点处理查找信息的负载过大,实现负载平衡,并与传统的泛洪算法进行了比较。模拟实验证明该算法能够缩短资源请求的响应时间,并且减少网格通信开销。A three-layer P2P-Grid model is proposed which improves the two-layer model. A class-peer is a higher performance peer above super-peer which can store class information. Bases on the rumor-spreading mechanism which can be compared with the traditional flooding mechanism, a resource lookup algorithm is presented. Rumor spreading has the character; the more it received the less it spread, so load balance can realize by avoiding a node＇s lookup task too heavy. Analysis shows that it can diminish the time of query and optimize the cost of communication.

关 键 词：P2P—Grid模型 超级节点 分类节点 泛洪机制 流言传播机制 广播开销 

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