A fully decentralized approach to Grid service discovery using self-organized overlay networks

N/ACitations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Self-organized overlay is widely used in Peer-to-peer (P2P) networks for its scalability, adaptability, and fault-tolerance in large and dynamic environments. In this paper, we propose a fully decentralized approach, DGSD (Decentralized Grid Service Discovery) for Grid service discovery. DGSD makes use of the underlying P2P overlay network protocols to self-organize nodes and services in the Grid. In DGSD, Grid service is represented by (attribute, value) pairs, and the Grid community, named virtual organization (VO), is self-organized into 2-dimensional overlay networks. One for attributes, and the other for values. Service discovery request in a VO is firstly directed to the attribute overlay network to find the servers with the searched attributes, then to the value overlay until the servers which have the same (attribute, value) pairs are reached. The architecture of DGSD supports interactions between VO's. Our approach is highly efficient, scalable and quickly responsive. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Xia, Q., Wang, W., & Yang, R. (2005). A fully decentralized approach to Grid service discovery using self-organized overlay networks. In Lecture Notes in Computer Science (Vol. 3470, pp. 164–172). Springer Verlag. https://doi.org/10.1007/11508380_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free