Abstract

Matchmaking is an important aspect of the Web Services interactions, which enables a service requester to locate the most suitable counterpart. However, current service matching algorithms operate on service advertisements, which don’t contain enough information to select a service instance that the consumer can immediately interact with. In this paper, we propose a precise matching algorithm, based on WS-Agreement and OWL-S, to deal with this challenge. We show how to combine WS-Agreement with OWL-S to obtain an agreement-style service description, and how the degree of match between two descriptions of this style is calculated.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.