基于Hierarchy结构的网格资源发现算法

Hierarchy-based resource discovery algorithm in grid environment

为了解决传统资源发现机制不能很好地适应网络状态、可扩展性较差等问题,在超级节点模型的基础上,结合联系节点,建立了一种基于层次结构的网格模型,设计了成员加入协议,给出了基于跳数限定、缓存列表的资源发现算法。通过对网络架构的分析,该模型能够适应网格资源的复杂性与异构性,可扩展性好。实验结果证明:该算法缩短了查询时间,提高了网格环境下资源发现的效率。

In order to solve the problems of conventional resource discovery framework, a hierarchy-based model was discussed, which combined super-peer model and contact node, a membership join protocol was introduced, and a resource discovery algorithm was proposed based on Time To Live （TTL） limit and cache list. The network framework with good scalability can adapt to complexity and heterogeneity of grid resources. The simulation shows that the algorithm works well, query time is minimized and efficiency of resource discovery is improved in grid environment.