A New Approach for Semantic Web Matching

TL;DR

This paper introduces a novel semantic web matching method utilizing bipartite graphs to enhance web service replacement, ensuring high availability and self-management in automated systems.

Contribution

It proposes a bipartite graph-based matching approach that compares web service functionalities for improved service replacement accuracy.

Findings

Matching based on functionalities yields better results.

The approach improves service availability and self-management.

Bipartite graph effectively identifies the most similar services.

Abstract

In this work we propose a new approach for semantic web matching to improve the performance of Web Service replacement. Because in automatic systems we should ensure the self-healing, self-configuration, self-optimization and self-management, all services should be always available and if one of them crashes, it should be replaced with the most similar one. Candidate services are advertised in Universal Description, Discovery and Integration (UDDI) all in Web Ontology Language (OWL). By the help of bipartite graph, we did the matching between the crashed service and a Candidate one. Then we chose the best service, which had the maximum rate of matching. In fact we compare two services` functionalities and capabilities to see how much they match. We found that the best way for matching two web services, is comparing the functionalities of them.