Abstract
Web Services are emerging technologies that enable application to application communication and reuse of services over Web. Semantic Web improves the quality of existing tasks, including Web services discovery, invocation, composition, monitoring, and recovery through describing Web services capabilities and content in a computer interpretable language. To provide most of the requested Web services, a Web service matchmaker is usually required. Web service matchmaking is the process of finding an appropriate provider for a requester through a middle agent. To provide the right service for the right user request, Quality of service (QoS)-based Web service selection is widely used. Employing QoS in Web service selection helps to satisfy user requirements through discovering the best service(s) in terms of the required QoS. Inspired by the mode of the Internet Web search engine, like Yahoo, Google, in this paper we provide a QoS-based service selection algorithm that is able to identify the best candidate semantic Web service(s) given the description of the requested service(s) and QoS criteria of user requirements. In addition, our proposed approach proposes a ranking method for those services. We also show how we employ data warehousing techniques to model the service selection problem. The proposed algorithm integrates traditional match making mechanism with data warehousing techniques. This integration of methodologies enables us to employ the historical preference of the user to provide better selection in future searches. The main result of the paper is a generic framework that is implemented to demonstrate the feasibility of the proposed algorithm for QoS-based Web application. Our presented experimental results show that the algorithm indeed performs well and increases the system reliability.
Highlights
IntroductionBesides as the users often do not know how to quantify the trade-offs between different Web services and just wish to quickly grasp what can be potentially interesting, a single solution that is the best one from an objective point of view typically does not exist; instead, many reasonable alternative services usually exist
We explore our proposed approach the proposed system proceeds as follow: First, given a user request we search for candidate providers that can support this request and we need to filter the resulted candidate services set generated from the SPSL (Service Provider Selection Algorithm) to a) remove bad provider's, and b) to decrease the search space; this is achieved by checking semantic matching between the candidates and service request
In this paper we propose an algorithm that is used as a tool in the selection of Web services based on the available providers and user requirements
Summary
Besides as the users often do not know how to quantify the trade-offs between different Web services and just wish to quickly grasp what can be potentially interesting, a single solution that is the best one from an objective point of view typically does not exist; instead, many reasonable alternative services usually exist. As both the user requirements, and the number of available services and service providers increases, improving the effectiveness and accuracy of Web service discovery and selection mechanisms becomes a crucial issue [2, 3]. UDDI is basically a framework that supports category based search [4]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
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 callMore From: International Journal of Advanced Computer Science and Applications
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.
