Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a centralized UDDI registry serves content in the form of metadata describing web services. Thus, the intersection between P2P and Web services is clear, so that it recently gained lots of interest: there is the need of finding a way to exploit the high potential of web services without paying in terms of scalability or single-point-of-failures. Our aim in this paper is two-fold: on one hand, we want to present a high level protocol for the addressing and the discovery of web services that is totally decentralized and based on a structured P2P topology. On the other hand, we introduce a way to solve the exact match key-based routing problem, that afflicts structured P2P systems. This model guarantees that all addressed web services will be discovered in a logarithmic number of hops, as it is based on a Distributed Hash Table. One of the key innovation is the possibility of customizing the categorization of web services using tags, which are becoming very common in the so calledWeb 2.0.

A Totally Distributed Iterative Scheme for Web Services Addressing and Discovery

RUFFO, Giancarlo Francesco;SCHIFANELLA, ROSSANO
2007-01-01

Abstract

Both web services framework and peer-to-peer networks provide a discovery process, but as current P2P systems focus more on the discovery of content in the form of common files (possibly associated with metadata), a centralized UDDI registry serves content in the form of metadata describing web services. Thus, the intersection between P2P and Web services is clear, so that it recently gained lots of interest: there is the need of finding a way to exploit the high potential of web services without paying in terms of scalability or single-point-of-failures. Our aim in this paper is two-fold: on one hand, we want to present a high level protocol for the addressing and the discovery of web services that is totally decentralized and based on a structured P2P topology. On the other hand, we introduce a way to solve the exact match key-based routing problem, that afflicts structured P2P systems. This model guarantees that all addressed web services will be discovered in a logarithmic number of hops, as it is based on a Distributed Hash Table. One of the key innovation is the possibility of customizing the categorization of web services using tags, which are becoming very common in the so calledWeb 2.0.
2007
19th IASTED International Conference on Parallel and Distributed Computing and Systems
Cambridge, Massachusetts, USA
November 19-21, 2007
Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
ACTA Press
85
90
9780889867031
9780889867048
Distributed Computing; Web-based Systems; Web Services; Addressing; Discovery; Distributed Hash Tables
M. MILANESIO; G. RUFFO; R. SCHIFANELLA
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2318/27307
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact