Interest-based overlay construction and message routing in service-oriented peer-to-peer networks

  • Authors:
  • Michele Amoretti;Matteo Agosti;Francesco Zanichelli

  • Affiliations:
  • University of Parma, Parma, Italy;University of Parma, Parma, Italy;University of Parma, Parma, Italy

  • Venue:
  • PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Ontology-based annotation of services is emerging, in the context of Semantic Web or Web 3.0, as an effective technique for automatic service discovery and composition, yet the highly invoked convergence with the peer-to-peer paradigm is still an open issue. We propose a structured peer-to-peer architectural model in which connectivity rules are interest-based, and service location information is placed in a Distributed Hash Table (DHT), according to a deterministic strategy driven by semantic matching between service profiles and peer interests. The basic idea is to build a key space in which each ID provides complete information about the categories to which the resource (i.e. peer or service) is associated. In this context, the concept of interest corresponds to the categories to which a service belongs, or those for which the peer searches the network. The paper shows the results of several simulation experiments we performed to evaluate the performance of the search algorithm in terms of network resource coverage and to assess system resilience in presence of churn.