北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2006, Vol. 29 ›› Issue (1): 17-21.doi: 10.13190/jbupt.200601.17.wangm

• 综述 • 上一篇    下一篇

基于小世界聚类的网格资源查找算法

王 嫚,徐惠民   

  1. 北京邮电大学 电信工程学院, 北京 100876
  • 收稿日期:2004-12-01 出版日期:2006-02-28 发布日期:2006-02-28
  • 作者简介:王 嫚(1973—),女,博士生,E-mail: wilma155@sohu.com

Small World-Clustering-Based Grid Resource Search Algorithm

WANG Man,XU Hui-min   

  1. School of Telecommunication Engineering, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2004-12-01 Online:2006-02-28 Published:2006-02-28

摘要:

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

关键词: 网格资源管理, 聚类, 小世界, 资源路由

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.

Key words: grid resource management, clustering, small-world, resource routing

中图分类号: