Service discovery is the process of retrieving the service most similar to the query based on the description of functional and/or non-functional semantics. The original algorithm used in literature was proposed by Paolucci et al., 2002. Some research works, propose an extension or an improvement of this algorithm to correct the matchmaking used. In this paper we present an algorithm of matchmaking that resolves the problems of Paolucci algorithm by using the shortest path algorithm which determines the optimal matching between user query and provider service. This approach is validated within a framework proposed at the end of this paper and compared with the greedy approach and the bipartite graph based matching..
展开▼
机译：服务发现是基于功能和/或非功能语义的描述检索与查询最相似的服务的过程。 Paolucci et al。，2002提出了文献中使用的原始算法。一些研究工作提出了对该算法的扩展或改进，以纠正所使用的匹配。在本文中，我们提出了一种配对算法，它使用最短路径算法解决了Paolucci算法的问题，该算法确定了用户查询和提供者服务之间的最佳匹配。该方法在本文末尾提出的框架内得到了验证，并与贪婪方法和基于二部图的匹配进行了比较。
展开▼
