| Virtual and Dynamic Hierarchical Architecture:an overlay network topology for discovering grid services with high performance |
| |
| 作者姓名： | 黄理灿 吴朝晖 潘云鹤 |
| |
| 作者单位： | College of Computer Science，Zhejiang University，Hangzhou 310027，China，College of Computer Science，Zhejiang University，Hangzhou 310027，China，Ministry's intelligent virtual research center，Hangzhou 310027，China |
| |
| 基金项目： | Project supported by virtual cooperative research granted by theChinese Ministry of Education |
| |
| 摘 要： | INTRODUCTION Grid (Foster et al., 2001) technology is one ofthe most important ones to appear in recent years.The recent big progress is that scientists (Foster etal., 2002; Roure et al., 2001; Rana and Walker,2002) proposed service-oriented architectures suchas Open Grid Services Architecture (OGSA) (Fos-ter et al., 2002) that integrated the so-called com-putational/data Grid architecture (Foster et al.,2001) with Web services (Grid Web ServicesWorkshop, 2001). In the service-ori…
|
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). |
| |
| Authors: | HUANG Li-can WU Zhao-hui PAN Yun-he |
| |
| Institution: | HUANG Li-can1,WU Zhao-hui 1,PAN Yun-he 2 |
| |
| 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 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 Pro- tocol. |
| |
| Keywords: | VDHA Grid Protocol Peer-to-peer Service discovery |
| 本文献已被 CNKI 等数据库收录！ |
