Skip to main content
SpringerLink
Log in

A Peer-to-Peer Approach to Web Service Discovery

  • Published:
World Wide Web Aims and scope Submit manuscript

Abstract

Web Services are emerging as a dominant paradigm for constructing and composing distributed business applications and enabling enterprise-wide interoperability. A critical factor to the overall utility of Web Services is a scalable, flexible and robust discovery mechanism. This paper presents a Peer-to-Peer (P2P) indexing system and associated P2P storage that supports large-scale, decentralized, real-time search capabilities. The presented system supports complex queries containing partial keywords and wildcards. Furthermore, it guarantees that all existing data elements matching a query will be found with bounded costs in terms of number of messages and number of nodes involved. The key innovation is a dimension reducing indexing scheme that effectively maps the multidimensional information space to physical peers. The design and an experimental evaluation of the system are presented.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. T. Bially, “A class of dimension changing mapping and its application to bandwidth compression,” Ph.D. thesis, Polytechnic Institute of Brooklyn, 1967.

  2. I. Clarke, O. Sandberg, B. Wiley, and T. W. Hong, “Freenet: A distributed anonymous information storage and retrieval system,” in Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, 2000, pp. 311–320.

  3. A. Crespo and H. Garcia-Molina, “Routing indices for peer-to-peer systems,” in Proceedings of the 22nd International Conference on Distributed Computing Systems (ICDCS), Vienna, Austria, 2002, pp. 23–34.

  4. Gnutella webpage, http://gnutella.wego.com/

  5. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker, “Search and replication in unstructured peer-to-peer networks,” in Proceedings of the 16th International Conference on Supercomputing, New York, NY, 2002, pp. 84–95.

  6. B. Moon, H. V. Jagadish, C. Faloutsos, and J. H. Saltz, “Analysis of the clustering properties of Hilbert space-filling curve,” IEEE Transactions on Knowledge and Data Engineering 13(1), 2001, 124–141.

    Google Scholar 

  7. Open Grid Services Architecture (OGSA), http://www.globus.org/ogsa/

  8. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker, “A scalable content-addressable network,” in Proceedings of ACM SIGCOMM, San Diego, CA, 2001, pp. 161–172.

  9. A. Rowstron and P. Druschel, “Pastry: Scalable, distributed object location and routing for largescale peerto-peer systems,” in Proceedings of IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, 2001, pp. 329–350.

  10. H. Sagan, Space-Filling Curves, Springer-Verlag, New York, NY, 1994.

    Google Scholar 

  11. M. Schlosser, M. Sintek, S. Decker, and W. Nejdl, “A scalable and ontology-based P2P infrastructure for semantic web services,” in Proceedings of the Second International Conference on Peer-to-Peer Computing (P2P'02), Linkoping, Sweden, 2002, pp. 104–111.

  12. K. Sivashanmugam, K. Verma, R. Mulye, Z. Zhong, and A. Sheth, “Speed-R: Semantic P2P environment for diverse Web Service registries,” http://webster.cs.uga.edu/~mulye/SemEnt/Speed-R.html.

  13. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan, “Chord: A scalable peer-to-peer lookup service for Internet applications,” in Proceedings of ACM SIGCOMM, San Diego, CA, 2001, pp. 149–160.

  14. “Universal description, discovery and integration,” UDDI Technical White Paper, http://www.uddi.org/pubs/Iru_UDDI_Technical_White_Paper.pdf, 2000.

  15. B. Yang and H. Garcia-Molina, “Comparing hybrid peer-to-peer systems,” in Proceedings of the 27th International Conference on Very Large Databases (VLDB), Roma, Italy, 2001, pp. 561–570.

  16. B. Y. Zhao, J. Kubiatowicz, and A. D. Joseph, “Tapestry: An infrastructure for fault-tolerant widearea location and routing,” Technical Report UCB/CSD-01-1141, Computer Science Division, University of California at Berkeley, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Applied Software Systems Laboratory, Department of Electrical and Computer Engineering, Rutgers University, 94 Bret Road, Piscataway, NJ, 08854, USA

    Cristina Schmidt & Manish Parashar

Authors
  1. Cristina Schmidt
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Manish Parashar
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schmidt, C., Parashar, M. A Peer-to-Peer Approach to Web Service Discovery. World Wide Web 7, 211–229 (2004). https://doi.org/10.1023/B:WWWJ.0000017210.55153.3d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:WWWJ.0000017210.55153.3d

Search

Navigation