检索
E-mail
RSS
作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (1): 1-3.doi: 10.3969/j.issn.1000-3428.2010.01.001

• 博士论文 •    下一篇

基于虚拟组织的校园网格服务发现机制

张忠平，韩丽霞，任大娟，郭 静   

  1. (燕山大学信息科学与工程学院，秦皇岛 066004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-01-05 发布日期:2010-01-05

Campus Grid Service Discovery Mechanism Based on Virtual Organization

ZHANG Zhong-ping, HAN Li-xia, REN Da-juan, GUO Jing   

  1. (College of Information Science and Engineering, Yanshan University, Qinhuangdao 066004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-01-05 Published:2010-01-05

PDF

1461

被引次数

1

摘要： 为了有效定位校园网格中大量不同属性的动态服务，提出一种校园网格服务发现机制。以小世界模型为理论依据组建虚拟组织(VO)，构建普通节点-域-VO的3层体系结构模型，基于该模型提出IS-Gossip算法。最上层在VO之间、中间层在VO内各域间分别用IS-Gossip算法进行分布式查找，最下层在域内进行集中式查找。算法分析表明，该机制提高了服务发现的可扩展性和查询效率。

关键词: 校园网格, 服务发现, 虚拟组织, 小世界模型, IS-Gossip算法

Abstract: In order to locate a large number of dynamic services with various types in the campus grid effectively, this paper provides a discovery mechanism of campus grid service. According to the Small World theory, this paper establishes Virtual Organization(VO), builds the three-layer architecture model of common node, domain and VO, and proposes IS-Gossip algorithm based on this model. Distributed query is used among the VO on the top layer and the domains of the VO on the middle layer with IS-Gossip algorithm. Centralized query is used in the domain on the bottom layer. Algorithmic analysis demonstrates the mechanism improves the scalability and query efficiency of service discovery.

Key words: campus grid, services discovery, Virtual Organization(VO), Small World model, IS-Gossip algorithm

中图分类号: