Customizable Web Services Matching and Ranking Tool: Implementation and Evaluation

Abstract

The matchmaking is a crucial operation in Web service discovery and selection. The objective of the matchmaking is to discover and select the most appropriate Web service among the different available candidates. Different matchmaking frameworks are now available in the literature but most of them present at least one of the following shortcomings: (1) use of strict syntactic matching; (2) use of capability-based matching; (3) lack of customization support; and (4) lack of accurate ranking of matching Web service. The objective of this paper is thus to present the design, implementation and evaluation of the Parameterized Matching-Ranking Framework (PMRF) that fully overcomes the first, third and fourth shortcomings cited above and partially addresses the second one. The comparison of PMRF to iSeM-logic-based and SPAR-QLent, using the OWLS-TC4 datasets, shows that the algorithms supported by PMRF outperform those proposed in iSeM-logic-based and SPARQLent.

Virtualization Based Efficient Service Matching and Discovery in Internet of Things

“…The selection of most appropriate services is the main objective of service matching. At least one of the following shortcoming exists in the current matchmaking frameworks in [16] A parameterized matching-ranking framework (PMRF) is presented in [16]. It addresses the given four problems except partial fulfilment of the second one.…”