Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
On Fully Decentralized Resource Discovery in Grid Environments
GRID '01 Proceedings of the Second International Workshop on Grid Computing
Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems
Middleware '01 Proceedings of the IFIP/ACM International Conference on Distributed Systems Platforms Heidelberg
INS/Twine: A Scalable Peer-to-Peer Architecture for Intentional Resource Discovery
Pervasive '02 Proceedings of the First International Conference on Pervasive Computing
The Globus Project: A Status Report
HCW '98 Proceedings of the Seventh Heterogeneous Computing Workshop
Scalable, Efficient Range Queries for Grid Information Services
P2P '02 Proceedings of the Second International Conference on Peer-to-Peer Computing
A Peer-to-Peer Approach to Web Service Discovery
World Wide Web
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Hi-index | 0.00 |
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.