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

  • Authors:
  • Qi Xia;Weinong Wang;Ruijun Yang

  • Affiliations:
  • Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China;Network Center, Shanghai Jiaotong University, Shanghai, China;Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai, China

  • Venue:
  • EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

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.