Abstract

We propose a two-step, context-based semantic approach to the problem of matching and ranking Web services for possible service composition. Semantic understanding of Web services may provide added value by identifying new possibilities for compositions of services and context-based semantic. The semantic matching ranking approach is unique since it provides the Web service designer with an explicit numeric estimation of the extent to which a possible composition. This process consists of multiple services that can be executed in sequence or in a parallel process. Given a service request, a set of candidates (available services and service patterns) is dynamically generated layer by layer from inputs to outputs of this request. For each layer, the algorithm traverses a priori search space which is a set of service patterns from historical solutions, then it searches available services from the repositories. That means each layer contains all services and service patterns that can be executed with a set of outputs provided by previous layers. The search process terminates until all the outputs of a request are obtained.

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.