检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西华师范大学计算机学院,四川南充637002
出 处:《计算机应用》2007年第9期2227-2229,2232,共4页journal of Computer Applications
基 金:西华师范大学校级基金资助项目(05A011)
摘 要:Chord是一款较为成功的P2P资源发现算法,但在网格环境中由于网格资源固有的特性,影响了其发现效率。针对网格资源的复杂多样性以及很难精确分析其相似程度,提出利用模糊聚类的方法对资源进行属性划分,将资源分成多个资源相似集合,结合Chord路由算法,相似资源存放在较近的Peer上组织成2维Chord结构。实验结果表明,与原Chord路由算法相比,该策略能有效降低查寻时间,资源发现效率明显提高。Chord is a successful P2P resource discovery algorithm, but the inherent characteristic of grid resource affects the efficiency of discovery in grid environment. Focusing on the complexity and diversity of grid resource, and the fact that its similar degree was hardly analyzed in grid computing, a model for resource discovery based on fuzzy clustering was presented in this paper. This method will partition grid resource into many similar sets according to their properties. Similar resources are stored in the near Peer to be organized into 2D Chord to reduce access latency and raise lookup efficiency. Experimental results show that this approach can effectively reduce access latency compared with the original Chord. Thus, the efficiency of resource discovery is apparently improved.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.216.82.12