期刊文献+

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

A Dynamic Grid Naming Resolution Algorithm Based on DHT
下载PDF
导出
摘要 在分布异构的网格环境下,如何有效地查找网格资源是一个必须解决的问题,网格命名协议是利用全局统一的命名空间来发现网格资源的。该文在网格命名协议中采用了一种查找路由算法DHT的解决方案,可解决网格命名解析服务的可扩展性和灵活性。 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 resull is the features of DHT, including scalability, decentralization, availability, load balance, could be used in grid.
出处 《计算机工程》 EI CAS CSCD 北大核心 2006年第24期112-114,共3页 Computer Engineering
基金 国家自然科学基金资助项目(60403027)
关键词 网格命名协议 命名解析 分布式哈希表 SGNP Naming resolution Distributed hashing table(DHT)
  • 相关文献

参考文献6

  • 1Foster I,Kesselman C,Tsudik G.The Anatomy of the Grid:Enabling Scalable Virtual Organizations[J].International Journal of Super Computer Applications,2001,15 (3):200-222.
  • 2Czajkowski K,Fitzgerald S,Foster I,et al.Grid Information Services for Distributed Resource Sharing[C].Proceedings of the 10th IEEE International Symposium on High-performance Distributed Computing,2001.
  • 3Stoica I,Morris R,Karger D,et al.Chord A Scalable Peer-to-peer Lookup Service for Internet Applications[C].Proceedings of ACM SIG2 COMM′01,San Diego,California,USA,2001.
  • 4Grimshaw A S,Natrajan A,Humphrey M A,et al.From Legion to Avaki:the Persistence of Vision[M].Chichester:John Wiley & Sons,2003:266-298.
  • 5Apgar J,Grimshaw A S,Harris S,et al.Secure Grid Naming Protocol:Draft Specification for Review and Comment[EB/OL].http://sourceforge.net/projects/sgnp.
  • 6董芳,费新元,肖敏.对等网络Chord分布式查找服务的研究[J].计算机应用,2003,23(11):25-28. 被引量:18

二级参考文献4

  • 1Stoica I, Morris R, Karger D, et al. Chord A Scalable Peer-to-peer Lookup Service for Intemet Applications[ A]. Proceeding d ACMSIC, COMM 2001[C]. San Diego, California, USA, 2001.
  • 2Ramasamy S. Francis P. Handley M, et al. A Scalable Content-Addressable Network[ A] In Proceedings of ACM SIGCOMM 2001[ C]. San Diego, California, USA, 2001.
  • 3Rowstron A, Druschel P. Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems[R]. IFIP/ACM International Conference on Distributed Systems Platforms.Middleware, 2001.
  • 4Zhao BY, Kubiatowicz J, Joseph AD. Tapestry: An Infrastructure for Fauh-tolerant Wide-area Location and Routing[ R]. Technical Report No. UCB/CSD-01-1141, University of California Berkeley.UC Berkeley, Apr. 2001.

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部