Skip to main content

A Fully Decentralized Approach to Grid Service Discovery Using Self-organized Overlay Networks

  • Conference paper
Advances in Grid Computing - EGC 2005 (EGC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 3470))

Included in the following conference series:

  • 470 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Foster, I., Kesselman, C., Tuecke, S.: The anatomy of the grid: Enabling scalable virtual organizations. International Journal on Supercomputing Applications 15 (2001)

    Google Scholar 

  2. Foster, I., et al.: C.K.: The physiology of the grid: An open grid services architecture for distributed systems integration (2003)

    Google Scholar 

  3. Foster, I., Kasselman, K.: The globus project: A status report. In: IPPS/SPDP’98 Heterogeneous Computing Workshop (1998)

    Google Scholar 

  4. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A scalable content-addressable network. In: Proc. ACM SIGCOMM, San Diego, CA (2001)

    Google Scholar 

  5. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A scalable peer-to-peer lookup service for internet applications. In: Proc. ACM SIGCOMM 2001, pp. 149–160 (2001)

    Google Scholar 

  6. Rowstron, A.I.T., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Web services for business process design (2004), http://www.gotdotnet.com/team/xml-wsspecs/xlang-c/default.htm

  8. Christensen, E., Curbera, F., Meredith, G., Weerawarana, S.: Web services description language (WSDL) 1.1. w3c (2002), http://www.w3.org/tr/wsdl

  9. UDDI: Universal description, discovery and integration (2004), http://www.uddi.org/

  10. Crespo, A., Garcia-Molina, H.: Semantic overlay networks for p2p systems. Technical report, Computer Science Department, Stanford University (2002)

    Google Scholar 

  11. Huang, L., Wu, Z., Pan, Y.: A scalable and effective architecture for grid services discovery. In: Proceedings of SemPGRID 2003(2003)

    Google Scholar 

  12. Iamnitchi, A., Foster, I.: On fully decentralized resource discovery in grid environments. In: International Workshop on Grid Computing, Denver, Colorado. IEEE, Los Alamitos (2001)

    Google Scholar 

  13. Balazinska, M., Balakrishnan, H., Karger, D.: INS/Twine: A scalable peer-to-peer architecture for intentional resource discovery. In: Mattern, F., Naghshineh, M. (eds.) PERVASIVE 2002. LNCS, vol. 2414, p. 195. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Klein: M., Konig-Ries, B., Obreiter, P.: Lanes - a lightweight overlay for service discovery in mobile ad hoc networks. Technical Report 2003-6, University of Karlsruhe (2003)

    Google Scholar 

  15. Andrzejak, A., Xu, Z.: Scalable, efficient range queries for grid information services. In: Proceedings of the Second IEEE International Conference on Peer-to-Peer Computing, P2P 2002 (2002)

    Google Scholar 

  16. Tang, C., Xu, Z., Mahalingam, M.: Peersearch: Efficient information retrieval in peer-peer networks. Technical Report HPL-2002-198, Hewlett-Packard Labs (2002)

    Google Scholar 

  17. Asano, T., Ranjan, D., Roos, T., Welzl, E., Widmaier, P.: Space filling curves and their use in geometric data structures. Theoretical Computer Science 181, 3–15 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  18. Schmidt, C., Parashar, M.: A peer-to-peer approach to web service discovery. World Wide Web 7, 211–229 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xia, Q., Wang, W., Yang, R. (2005). A Fully Decentralized Approach to Grid Service Discovery Using Self-organized Overlay Networks. In: Sloot, P.M.A., Hoekstra, A.G., Priol, T., Reinefeld, A., Bubak, M. (eds) Advances in Grid Computing - EGC 2005. EGC 2005. Lecture Notes in Computer Science, vol 3470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11508380_18

Download citation

  • DOI: https://doi.org/10.1007/11508380_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-26918-2

  • Online ISBN: 978-3-540-32036-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics