首页 | 本学科首页   官方微博 | 高级检索  
     

Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance
引用本文:Huang LC,Wu ZH,Pan YH. Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance[J]. 浙江大学学报(自然科学英文版), 2004, 5(5): 539-549
作者姓名:Huang LC  Wu ZH  Pan YH
作者单位:[1]CollegeofComputerScience,ZhejiangUniversity,Hangzhou310027,China [2]Ministry'sintelligentvirtualresearchcenter,Hangzhou310027,China
摘    要:This paper presents an overlay network topology called Virtual and Dynamic Hierarchical Architecture (VDHA) for discovering Grid services with high performance. Service discovery based on VDHA has scalable, autonomous, efficient, reliable and quick responsive. We propose two service discovery algorithms. Full Search Query and Discovery Protocol (FSQDP) discovers the nodes that match the request message from all N nodes, which has time complexity O(logN), space complexity O(nvg) (nvg being node numbers of each virtual group), and message-cost O(N), and Domain-Specific Query and Discovery Protocol (DSQDP) searches nodes in only specific domains with time complexity O(nvg), space complexity O(nvg), and message-cost O(nvg). In this paper, we also describe VDHA, its formal definition, and Grid Group Management Protocol.

关 键 词:VDHA 虚拟动态分级结构 覆盖网络拓扑 发现服务 格子组管理协议

Virtual and dynamic hierarchical architecture: an overlay network topology for discovering grid services with high performance
Huang Li-can,Wu Zhao-hui,Pan Yun-he. Virtual and dynamic hierarchical architecture: an overlay network topology for discovering grid services with high performance[J]. Journal of Zhejiang University Science, 2004, 5(5): 539-549
Authors:Huang Li-can  Wu Zhao-hui  Pan Yun-he
Affiliation:College of Computer Science, Zhejiang University, Hangzhou 310027, China. lchuang@cs.zju.edu.cn
Abstract:This paper presents an overlay network topology called Virtual and Dynamic Hierarchical Architecture (VDHA) for discovering Grid services with high performance. Service discovery based on VDHA have scalable, autonomous, efficient, reliable and quick responsive. We propose two service discovery algorithms. Full Search Query and Discovery Protocol (FSQDP) discovers the nodes that match the request message from all N nodes, which has time complexity O(logN), space complexity O(nvg) (nvg being node numbers of each virtual group), and message-cost O(N), and Domain-Specific Query and Discovery Protocol (DSQDP) searches nodes in only specific domains with time complexity O(nvg), space complexity O(nvg), and message-cost O(nvg). In this paper, we also describe VDHA, its formal definition, and Grid Group Management Protocol.
Keywords:
本文献已被 维普 PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号