作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (24): 112-114. doi: 10.3969/j.issn.1000-3428.2006.24.040

• 网络与通信 • 上一篇    下一篇

一种基于DHT的动态网格命名解析方案

黄晓涛,叶淮光   

  1. (华中科技大学计算机学院,武汉 430074)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-20 发布日期:2006-12-20

A Dynamic Grid Naming Resolution Algorithm Based on DHT

HUANG Xiaotao, YE Huaiguang   

  1. (College of Computer, Huazhong University of Science & Technology, Wuhan 430074)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-20 Published:2006-12-20

摘要: 在分布异构的网格环境下,如何有效地查找网格资源是一个必须解决的问题,网格命名协议是利用全局统一的命名空间来发现网格资源的。该文在网格命名协议中采用了一种查找路由算法DHT的解决方案,可解决网格命名解析服务的可扩展性和灵活性。

关键词: 网格命名协议, 命名解析, 分布式哈希表

Abstract: In grid, which is a distributed and heterogeneous environment, a fundamental problem is to locate required resource. In secure grid naming protocol, it has unique naming space, which can identify grid resource. This article tries to use DHT, which is a common route algorithm in peer-to-peer, as a new naming resolution way for secure grid naming protocol. The result is the features of DHT, including scalability, decentralization, availability, load balance, could be used in grid.

Key words: SGNP, Naming resolution, Distributed hashing table(DHT)