On power-law relationships of the Internet topology
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
UDDIe: An Extended Registry for Web Services
SAINT-W '03 Proceedings of the 2003 Symposium on Applications and the Internet Workshops (SAINT'03 Workshops)
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
VEGA infrastructure for resource discovery in grids
Journal of Computer Science and Technology - Grid computing
Synthesizing Realistic Computational Grids
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
The Anatomy of the Grid: Enabling Scalable Virtual Organizations
International Journal of High Performance Computing Applications
Peer-to-Peer resource discovery in Grids: Models and systems
Future Generation Computer Systems
A statistical theory of chord under churn
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
| Hi-index | 0.00 |
The diversity of grid service originates from heterogeneous and dynamic nature of grid, and it poses a great challenge to grid service discovery. How to discover services satisfying users' multiple requests meanwhile avoiding negative effect derived from requests and updates becomes increasingly important in grid environment. This paper proposes a Cross-VO (Visual Organization) service domain model for compensating deficiencies that traditional approaches exhibit in flexibility of discovery. Service domain is developed to make advantage of similarity among services. In this model each service domain is constructed through all services that have similar function in VOs and nodes in service domain connect according to unstructured P2P system. It breaks through resource restriction in a VO and satisfies users' requests in great extent while achieves favorable scalability and flexibility. Both theoretical analysis and experimental results indicate that this model performs efficiently in high discovery success ratio, low average hops and messages even with low density and small TTL. Compared with non-domain grid system via the same discovery success ratio, our model outperforms it in both average hops and messages.