摘要
对已有的网格资源发现方法进行分析,提出一种以P2P方式实现的、基于小世界特性的非集中式网格资源发现算法。算法将具有相似兴趣属性的结点组织在一起形成兴趣簇,使得搜索请求尽量在簇内进行传播。仿真测试结果表明,该算法可以很好地减少资源发现的通信开销,并有着较高的搜索成功率。
Analyzes existing resource discovery methods, and proposes a grid resource discovery algorithm: peer-to-peer and decentralized small-world character based algorithm to address the search and location of issues. The algorithm divides nodes into interest-clusters. Search request is propagated between nodes with similar interest within interest-clusters. Simulation results show that, the algorithm improves query efficiency notably without a significant increases in load.
出处
《现代计算机》
2008年第12期59-62,共4页
Modern Computer
关键词
网格
资源发现
小世界
需求近似度
Grid
Resource Discovery
Small-World
Need Degree of Approximation