基于Hierarchy与社会关系的网格资源发现算法研究  

Grid Resource Discovery Algorithm Based on Hierarchy and Social Relation

作　　者：刘俊祥[1] 于炯[1,2] 汪明军[1] 

机构地区：[1]新疆大学信息科学与工程学院,新疆乌鲁木齐830046 [2]北京理工大学计算机学院,北京100081

出　　处：《微电子学与计算机》2009年第9期132-135,共4页Microelectronics & Computer

基　　金：国家自然科学基金(60563002;60863003);教育部春晖计划项目(Z2005-1-65009)

摘　　要：介绍了社会关系集中到分层的网格,中间层采用基于小世界模型构建的社会关系网络———关系网格.这种架构在集中管理的高效率和完全分布的可扩展性之间达成平衡.在构建关系网格的过程中,提出了兴趣度限制关系网格,以节省开销,提高资源发现效率.仿真实验结果表明,HRRD(Hierarchy and relation grid resource dicovery)算法大大精简了搜索空间,提高了网格资源发现效率.This paper introduces a grid based on hierarchy and social relation, the middle layer is relation grid which constructed of small world network. Such frame achieves a balance between efficiency of centralized management and scalablity of distribute structure. In the process of building relation grid, put forward the restriction of interest degree to save rests and improve efficiency of resource discovery. The simulation results show that HRRD （Hierarchy and relation grid resource dicovery） algorithm greatly streamlines the search space and improves the efficiency of grid resource discovery.

关 键 词：资源发现 HIERARCHY 小世界 关系网格 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]