【摘要】 在网格环境中分布着大量不同类型的资源,为了更有效地解决网格资源的搜索和定位问题,提出了一种基于小世界聚类的网格资源查找算法.它以小世界模型作为理论依据,确定聚类中心,按照分级扩散的原则对网格资源进行全局搜索.为了提高算法的可扩展性,以一定概率增加网络连接,使节点连接的概率随距离的增大而衰减,缩短了查找平均路径长度.仿真实验证明,基于小世界聚类的网格资源发现算法具有良好的搜索能力和扩展性.更多还原

【Abstract】 There are a great deal and various types of resource in a distributed grid environment.A grid resource search algorithm: small-world-clustering-based routing algorithm was described to improve the search and location of diverse properties.According to the small world theory,the clustering center was used to the grade diffuse and the request for performing a well-ordered search from a global view.In order to improve scalability,a few shortcuts with distant peers were inserted into the routing tables with some probabilities,and then the average path length was reduced.The preliminary simulation results show that the key clustering algorithm with shortcuts is efficient and scalable.更多还原