Full Text:
<2566>
CLC number: TP391.0
On-line Access:
Received: 2003-01-10
Revision Accepted: 2003-06-23
Crosschecked: 0000-00-00
Cited: 0
Clicked: 6193
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 A, 2004, 5(5): 539-549.
@article{title="Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance",
author="HUANG Li-can, WU Zhao-hui, PAN Yun-he",
journal="Journal of Zhejiang University Science A",
volume="5",
number="5",
pages="539-549",
year="2004",
publisher="Zhejiang University Press & Springer",
doi="10.1631/jzus.2004.0539"
}
%0 Journal Article
%T Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance
%A HUANG Li-can
%A WU Zhao-hui
%A PAN Yun-he
%J Journal of Zhejiang University SCIENCE A
%V 5
%N 5
%P 539-549
%@ 1869-1951
%D 2004
%I Zhejiang University Press & Springer
%DOI 10.1631/jzus.2004.0539
TY - JOUR
T1 - Virtual and Dynamic Hierarchical Architecture: an overlay network topology for discovering grid services with high performance
A1 - HUANG Li-can
A1 - WU Zhao-hui
A1 - PAN Yun-he
J0 - Journal of Zhejiang University Science A
VL - 5
IS - 5
SP - 539
EP - 549
%@ 1869-1951
Y1 - 2004
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/jzus.2004.0539
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) (nvgbeing 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.
[1] Chander A., Dawson, S., Lincoln, P., Stringer-Calvert, D., 2002. NEVRLATE: Scalable Resource Discovery. Proceedings CCGRID. 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid.
[2] Christensen, E., Curbera, F., Meredith, G., Weerawarana, S., 2001. Web Services Description Language (WSDL) 1.1. W3C, Note 15, http://www.w3.org/TR/wsdl.
[3] Foster, I., Kesselman, C., 1997. Globus: a metacomputing infrastructure toolkit.International Journal of Super-computer Applications,11(2):115-128.
[4] Foster, I., Kesselman, C., Tuecke, S., 2001. The anatomy of the grid: enabling scalable virtual organizations.International Journal of High Performance Computing Applications,15(3):200-222.
[5] Foster, I., Kesselman, C., Nick, M.J., Tuecke, S., 2002.The Physiology of the Grid: An Open Grid Services Architecture for Distributed Systems Integration. http://www.globus.org/research/papers/ogsa.pdf.
[6] Grid Web Services Workshop, 2001. http://gridport.npaci.edu/workshop/webserv01/agenda.html.
[7] Huang, L.C., Zhou, X., Wu, Z.H., Pan, Y.H., 2002a. Virtual and Dynamic Hierarchical Architecture and Its Usage in An E-Science Application for Providing Knowledge Services.In: Proceedings of the Joint International Computer Conference 2002(JICC2002). Zhejiang University Press, Hangzhou, p.159-165.
[8] Huang, L.C., Wu, Z.H., Pan, Y.H., 2002b. Virtual and Dynamic Hierarchical Architecture for E-Science and Related Protocols.In: Proceedings of 2002 International Symposium on Distributed Computing and Applications to Business, Engineering and Science (DCABES2002).
[9] Huang, L.C., Wu, Z.H., Pan, Y.H., 2002c.Knowledge Services Provider Model Based on Virtual and Dynamic Hierarchical Architecture.In: Proceedings of 2002 International workshop on Grid and Cooperative Computing(GCC2002). Publishing House of Electronics Industry, Beijing, p.297-311.
[10] Iamnitchi, A., Foster, I., 2001. On Fully Decentralized Resource Discovery in Grid Environments. International Workshop on Grid Computing .
[11] Rana, O.F., Walker, D.W., 2002. Service Design Patterns for Computational Grids.In: Patterns and Skeletons for Parallel and Distributed Computing, edited by Fethi A. Rabhi and Sergei Gorlatch, Springer-Verlag.
[12] Ratnasamy, S., Francis, P., Handley, K., Karp, R., Shenker, S., 2001. A Scalable Content-Addressable Network.In: Proceedings of ACM SIGCOMM 2001.
[13] Roure, D.D., Jennings, N., Shadbolt, N., 2001. Research Agenda for the Semantic Grid: A Future E-Science Infrastructure. http://www.semanti.grid.org/v1.9/sem-grid.pdf.
[14] Rowstron, A., Druschel, P., 2001. Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Pear Systems.In: Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware).
[15] Stoica, I., Morris, R., Karger, D., Kaashoek, F.M., Balakrishnan, H., 2001. Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications.In: Proceedings of ACM SIGCOMM2001.
[16] UDDI: Universal Description, Discovery and Integration, 2001. http://www.uddi.org/.
[17] Wahl, M.,Howes, T., Kille, S., 1997.Lightweight Directory Access Protocol (v3),IETF RFC 2251.
[18] Web Services Flow Language (WSFL) Version 1.0, 2001. http://www4.ibm.com/software/solutions/Web-sevices/pdf/WSFL.pdf.
[19] Web Services for Business Process Design, 2001. http://www.gotdonet.com/team/xml_wsspecs/xlang-c/default.htm.
Open peer comments: Debate/Discuss/Question/Opinion
<1>