Web Service Discovery for Cloud-Based Mobile Application Using Multi-Level Clustering and QoS-Based Ranking

The current register and discovery protocol as UDDI is a keyword-based and precisely matching service discovery mechanism and it can’t describe the semantic information of a Web service. Many suitable Web services can’t be discovered automatically by the traditional service discovery methods. In order to resolve these problems, this paper presents a method of semantic Web service discovery based on bipartite graph matching. It makes computers recognize semantic information of Web Services. The method contributes to the improvement of service discovery efficiency when service is retrieved in an automatic way.KeywordsUDDIsemantic Web servicebipartite graph matching

Background/Objectives: This article proposes a novel methodology based on rubrics and feature-based schemes for the appraisal and comparison of approaches to semantic Web services composition and discovery. Methods/Statistical analysis: In order to evaluate the Semantic Web services composition and discovery approaches we created a new framework called RFSWS. This framework is the combination of traditional feature-based evaluation schemes and newly developed analytic rubrics tables. Five recently introduced prominent Semantic Web services composition approaches were identified, explained, and then evaluated/compared using RFSWS. Findings: In this work we determined aspects of Semantic Web services composition and discovery processes that can be evaluated as performance criteria in rubric tables. This is a novel application of rubrics, which have traditionally been used for grading student performance by teachers. We created a novel framework called RFSWS consisting of rubric tables and a feature-based evaluation scheme for the evaluation and comparison of Semantic Web service discovery and composition approaches, and applied it in the evaluation of five recently introduced prominent Semantic Web services composition approaches. Considering the shortcomings of existing Semantic Web services composition approaches that were discovered through this evaluation, we proposed an idealized dynamic Semantic Web service discovery and composition method, a yardstick by which all future Semantic Web services composition approaches can be evaluated. Application/ Improvements: Our novel RFSWS framework can be applied in the comprehensive and systematic evaluation/comparison of Semantic Web services discovery and composition approaches.

The Web service infrastructure has been an important software component on the Internet. A critical step in Web service applications is the service discovery method. The structured information in the web services description language (WSDL) of a Web service is unsuitable when using the traditional information retrieval (IR) method. We propose a Web service discovery method that is based on extracting information from WSDL documents. The method employs data segmentation to analyze the information to a meaningful structure where the traditional IR techniques can be applied. Furthermore, WordNet has been exploited in this method to carry out a synonym search. The experiments show that our method represents a significant improvement in the performance of Web service discovery.

Web service (WS) discovery is a prerequisite for achieving WS composition and orchestration. Although a lot of research has been conducted on the functional discovery of WSs, the proposed techniques fall short when faced with the foreseen increase in the number of (potentially functionally-equivalent) WSs. The above situation can be resolved with the addition of non-functional (quality of service (QoS)) discovery mechanisms to WS discovery engines. QoS-based WS matchmaking algorithms have been devised for this reason. However, they are either slow - as they are based on ontology reasoners - or produce inaccurate results. Inaccuracy is caused both by the syntactic matching of QoS concepts and by wrong matchmaking metrics. In this paper, we present two constraint programming (CP) QoS-based WS discovery algorithms for unary constrained WS specifications that produce accurate results with good performance. We also evaluate these algorithms on matchmaking time, precision and recall in different settings in order to demonstrate their efficiency and accuracy.

Directory services are a genuine constituent of any distributed architecture which facilitate binding attributes to names and then querying this information, that is, announcing and discovering resources. In such contexts, especially in a business environment, Quality of Service (QoS) and non-functional properties are usually the most important criteria to decide whether a specific resource will be used. To address this problem, we present an approach to the semantic description and discovery of web services which specifically takes into account their QoS properties. Our solution uses a robust trust and reputation model to provide an accurate picture of the actual QoS to user. The search engine is based on an algebraic discovery model and uses adaptive query-processing techniques to parallelise expensive operators. Architecturally, the engine can be run as a centralised service for small-scale environments or can be distributed among any number of cooperating registry providers.

Shared-Repository based Approach for Storing and Discovering web Services

With the rapid growth and adoption of web-based technologies, more and more service providers offer various services on the web. This can facilitate the organizations to develop business applications using web services composition over the Internet according to their business requirements. The primary requirement for developing composite web service is to discover the most relevant web service for realizing each function of the required composite web service. Finding the most relevant web service is still a challenging task. In this paper, we propose web service discovery approach that incorporates web services clustering. Clustering technique combines latent Dirichlet allocation(LDA) and k-Medoids and reduces search space for web service discovery. Web service discovery uses a match-making algorithm that utilizes WordNet database and Hungarian method to compute the semantic similarity score for a web service based on the requested query. Experimental results show that the proposed approach performs better than LDA-based approach.

The development, registration, discovery, and invocation of quality Web services are vital for the successful implementation of applications using Web services. Considerable research focuses on quality for Web services. Unfortunately, current research on Quality of Service (QoS) for Web services is concentrated on service users and the implementation stage. This research highlights the importance of incorporating QoS at the design and development stages; the authors propose the introduction of QoS at the same time as functional requirements. However, Web Service Description Language (WSDL) describes the functional elements of a Web service, and QoS is significant for this description. Therefore, the authors propose an extension to the WSDL through a generic QoS metamodel, incorporating QoS specifications into the functionalities. This paper begins by defining the required QoS specifications for the development of quality Web services and explores the potential of the Unified Modeling Language as a technique and notation to specify QoS. To properly integrate QoS in the design, the authors propose extensions to the existing UML QoS profile. The paper concludes with the evaluation of the proposed framework and summarises its advantages.

In recent years, the web service is becoming more and more popular in various application domains, which attracts many researchers to contribute their efforts. Service searching is one of the fundamental topics in service-oriented applications. In traditional service matchmaking, most approaches uses keyword-based methods for service discovery that may cause difficulties in meeting users' demands precisely. In order to address the above problem, we propose, in this work, a web service discovery method that combines WordNet and domain ontologies, which could improve the quality and precision of the discovered web services by using semantic web technologies.

Web service discovery (WSD) is the task of matchmaking a set of relevant web services. Quality of service (QoS) has recently been applied to represent non-functional properties of web services. Therefore, when those services provide the same functionality but have different QoS values, how to effectively filter out the services that cannot satisfy the QoS constraints and rank the remaining services is still an open research issue. In this paper, we propose an integrated approach that allows a service requester to specify a functionality request, multiple QoS constraints and their preferences, and our method discovers a set of the most appropriate ranked services with QoS utility aggregation. By conducting empirical experiments on simulated web services, we validate the feasibility of our service discovery approach. The running example shows that, our approach can find more appropriate services by the satisfiability of multiple QoS constraints and the ranking of aggregated QoS.

In modern heterogeneous environments, such as mobile, pervasive and ad-hoc networks, architectures based on web services offer an attractive solution for effective communication and inter-operation. In such dynamic and rapidly evolving environments, efficient web service discovery is an important task. Usually this task is based on the input/output parameters or other functional attributes, however this does not guarantee the validity or successful utilization of retrieved web services. Instead, non-functional attributes, such as device power features, computational resources and connectivity status, that characterize the context of both service providers and consumers play an important role to the quality and usability of discovery results. In this paper we introduce context-awareness in web service discovery, enabling the provision of the most appropriate services at the right location and time. We focus on context-based caching and routing for improving web service discovery in a mobile peer-to-peer environment. We conducted a thorough experimental study, using our prototype implementation based on the JXTA framework, while simulations are employed for testing the scalability of the approach. We illustrate the advantages that this approach offers, both by evaluating the context-based cache performance and by comparing the efficiency of location-based routing to broadcast-based approaches.

Web services provide a promising solution to an age old need of fast and flexible information sharing among people and businesses. One of the key research issues in web services is selection of most pertinent web services. Selection of web service has become a tedious job because of the increasing number of service providers providing services with similar functionality. Therefore, a framework for selection and discovery of web service that can meet the non-functional requirements is needed. In this work, we have developed a selection tool (WSS-NFP) for web services which can rank services based on their non functional properties such as performance, delay etc. We have used soft computing techniques for selection and discovery of web services based on non functional properties. These properties are fuzzy in nature. A tool is developed and implemented that is generic in nature and can be customized for any application domain. As a core of this tool, it consists of Fuzzy System for ranking web services and Neural Network for fine tuning the membership functions for linguistic terms. Appropriate and fine tuned membership functions help in minimizing the output error measure and maximizing the performance index of the proposed tool. This tool is basically a Neuro-Fuzzy system for ranking web services of any domain.

The expansion of web service provider's number over the web has motivated the research community to invest in web service discovery area. However, in order to efficiently identify appropriate services, web services requesters should express their requests in rich, standard and machine-readable manner. In this context, we propose the use of a Service Request Template based on SAWSDL and WS-Policy standards. We use SAWSDL language which constitutes an extension of WSDL to express both functional and semantic needs, while we use WS-Policy framework to specify both non-functional requirements and user's preferences. We think that the proposed template would make it possible to overcome problems due to the heterogeneity between web services requests and published web services when executing discovery process. To perform efficient service discovery, we develop a structure-based matching algorithm that offers three mechanisms: semantic, data types and policy matching.

Nowadays, with the advancement in mobile technologies, the use of web services has seen an explosion in interest for mobile computing environment. However, the heavyweight nature of conventional web services to be deployed on mobile devices brings new challenges in mobile computing in the coming future. Web services technology and mobile computing domains are converging at their intersection which leads to Mobile Web Services (MWS) which enables the service access in users’ mobile device. As the numbers of web services are increasing dramatically, the web service discovery becomes more important to discover the usable web services in effective and efficient manner. This paper discusses an overview of mobile challenges in MWS recent research, and a summary of the issues. Moreover, current approaches of Mobile Web Services Discovery are classified and these approaches are compared to some criteria. The results of this study will help researchers to deliver more applicable solutions with the most appropriate approaches for Mobile Web Services Discovery.KeywordsWeb ServicesMobile Web Serviceweb service discoverymobile computingmobile web service discovery

The ample adoption of web services raises the challenging problem in web service discovery. Web service discovery is the process of finding appropriate services for the user defined tasks. The big challenge in web service discovery is to discover the services that suit the user requirements and to enhance the efficiency and accuracy in matchmaking procedures. This poster focuses on matchmaking in web service discovery. The objective of matchmaking is to match the service requests with the web service advertisements and to offer appropriate services. This paper is focus on the matchmaking architecture, its information flow and types of matchmaking techniques (functional based matchmaking, non-functional based matchmaking and hybrid matchmaking). It sets the basis for analysis of each matchmaking technique, the existing amenity and snag of it as well as the amendment of each technique.