Web Service Composition Method Research Articles

Experimental Analysis for Semantic based Large Scale Service Composition using Deep Learning

In Service Oriented Architecture (SOA) web services plays important role. Web services are web application components that can be published, found, and used on the Web. Also machine-to-machine communication over a network can be achieved through web services. Cloud computing and distributed computing brings lot of web services into WWW. Web service composition is the process of combing two or more web services to together to satisfy the user requirements. Tremendous increase in the number of services and the complexity in user requirement specification make web service composition as challenging task. The automated service composition is a technique in which Web Service Composition can be done automatically with minimal or no human intervention. In this paper we propose a approach of web service composition methods for large scale environment by considering the QoS Parameters. We have used stacked autoencoders to learn features of web services. Recurrent Neural Network (RNN) leverages uses the learned features to predict the new composition. Experiment results show the efficiency and scalability. Use of deep learning algorithm in web service composition, leads to high success rate and less computational cost.

A method towards Web service combination for cross-organisational business process using QoS and cluster

ABSTRACTHow to quickly combine various Web services to support cross-organisational business processes is the key technical problem in service computing. Because of the changeability of QoS of Web services, the traditional methods are unadaptable to the new environments. In this paper, a new service composition method, called Improved Self-organising neural network Method for Web Service Composition, is proposed to achieve QoS-aware Web service combination, according to using the clustering technology. First, fuzzy mathematics is used to express each QoS attribute and the improved self-organising neural network is used to cluster services to reduce the number of candidate services. Secondly, all the centre of each cluster is selected and formed a composite service by using an exhaustive algorithm. Thirdly, the service cluster that is represented by the concrete services. Finally, the optimal service combination can be selected using integer programming or genetic algorithm. The experimental result shows the efficiency of Web service composition and demonstrates the applicability.

An Optimized Semantic Web Service Composition Method Based on Clustering and Ant Colony Algorithm

An Optimized Semantic Web Service Composition Method Based on Clustering and Ant Colony Algorithm

Future Intelligent Systems and Networks

Future Intelligent Systems and Networks

Cross-organizational Collaborative Web Service Composition Method Based on Local Quality Constraint Resolution

Cross-organizational Collaborative Web Service Composition Method Based on Local Quality Constraint Resolution

A Reliability Calculation Method for Web Service Composition Using Fuzzy Reasoning Colored Petri Nets and Its Application on Supercomputing Cloud Platform

In order to develop a Supercomputing Cloud Platform (SCP) prototype system using Service-Oriented Architecture (SOA) and Petri nets, we researched some technologies for Web service composition. Specifically, in this paper, we propose a reliability calculation method for Web service compositions, which uses Fuzzy Reasoning Colored Petri Net (FRCPN) to verify the Web service compositions. We put forward a definition of semantic threshold similarity for Web services and a formal definition of FRCPN. We analyzed five kinds of production rules in FRCPN, and applied our method to the SCP prototype. We obtained the reliability value of the end Web service as an indicator of the overall reliability of the FRCPN. The method can test the activity of FRCPN. Experimental results show that the reliability of the Web service composition has a correlation with the number of Web services and the range of reliability transition values.

Recommendation for Web Service Composition by Mining Usage Logs

Web service composition has been one of the most researched topics of the past decade. Novel methods of web service composition are being proposed in the literature include Semantics-based composition, WSDLbased composition. Although these methods provide promising results for composition, search and discovery of web service based on QoS parameter of network and semantics or ontology associated with WSDL, they do not address composition based on usage of web service. Web Service usage logs capture time series data of web service invocation by business objects, which innately captures patterns or workflows associated with business operations. Web service composition based on such patterns and workflows can greatly streamline the business operations. In this research work, we try to explore and implement methods of mining web service usage logs. Main objectives include Identifying usage association of services. Linking one service invocation with other, Evaluation of the causal relationship between associations of services

A Novel Rubric and Feature-based Appraisaland Comparison Framework for the Evaluationof Semantic Web Services Composition Approaches

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.

A flexible QoS-aware Web service composition method by multi-objective optimization in cloud manufacturing

Cloud manufacturing, combining Web services via internet to a cooperative manufacturing system, has been an increasing popularity for global manufacturing. It will unlock the tremendous value in the massive amount of data being generated by the manufactories. The problem of QoS-aware Web service composition (QWSC), i.e., selecting appropriate service for each component of a service composition from a pool of functionally identicalservice to satisfy the users’ end-to-end QoS constraints, is a core of the cloud manufacturing. A novel QWSC method by multi-objective optimization is proposed to help users to make a flexible decision. First of all, the problem of QWSC is formulated to a multi-objective optimization model where either QoS performance or QoS risk (variance comparing to the user‘s QoS requirement) is the individual optimization objective. And then, an efficient ε-dominance multi-objective evolutionary algorithm (EDMOEA) is developed to solve the presented model. Finally, experimental results verify the effectiveness and efficiency of the proposed method for the large-scale QWSC problem.

A New Formal Modeling Method for Web Service Composition

With the rapid development of e-commerce, the application of web service composition is becoming increasingly important in many areas. If we apply unchecked web service composition, then we can only discover problems afterwards, and we have to devote unnecessary energy to repair. Here, formal modeling serves to be a premise to check. This paper brings up a formal modeling method for web service composition based on BDL (behavioral description language). The structure of this essay is to analyze the description of BPEL process, and we can get the formal model from the BPEL-to-BDL mapping relation.

Manufacturing service composition method based on networked collaboration mode

“Cluster Supply Chains” (CSCs) are a new type of business mode, which can help small- and medium-sized enterprises (SMEs) to respond to the changing market demands effectively through networked collaboration. As a large number of manufacturers start to adopt the emerging services paradigm, various cross-enterprise business collaborations in CSC can be deemed as the manufacturing service composition (MSC). However, existing web service composition methods are not appropriate for satisfying the specific demands of manufacturing services composition. The reason lies in two aspects: (1) Current Quality of Service (QoS) model cannot consider the horizontal collaboration between manufacturing services, which may ignore a lot of potential candidate services; (2) current methods are not good at dealing with the rapid increase of candidate service set, which need to be improved further in the searching capability. To solve the above problems, this paper first proposes the new QoS evaluation model of manufacturing service composition according to the networked collaboration pattern in CSC; secondly, the Genetic-Artificial Bee Colony (G-ABC) algorithm is proposed to enhance the performance of searching for the optimal solution based on the available horizontal composite service; finally, the effectiveness of the above solutions is validated through simulation experiments and the results are satisfactory.

Research on Semantic Web Service Composition Based on Binary Tree

With the rapid development of cloud computing and service computing, Web services are combined to form the composite service with a large granularity is an important research direction at present. The current service composition methods have the problems of low composition efficiency and accuracy, this paper proposes a semantic Web service composition method based on the binary tree. This method uses the ontology semantic reasoning relationship and binary tree theory to composite Web services. The composition relations between Web service interfaces are mainly considered. The approach can enhance the efficiency and accuracy of service composition, and the experiments are used to validate and analyze the proposed methods.

Automatic Composition of Semantic Web Services Based on Fuzzy Predicate Petri Nets

Web service composition is a challenging research issue. This paper presents an automatic Web service composition method that deals with both input/output compatibility and behavioral constraint compatibility of fuzzy semantic services. First, user input and output requirements are modeled as a set of facts and a goal statement in the Horn clauses, respectively. A service composition problem is transformed into a Horn clause logic reasoning problem. Next, a Fuzzy Predicate Petri Net (FPPN) is applied to model the Horn clause set, and T-invariant technique is used to determine the existence of composite services fulfilling the user input/output requirements. Then, two algorithms are presented to obtain the composite service satisfying behavioral constraints, as well as to construct an FPPN model that shows the calling order of the selected services.

A linear logic approach to the composition of RESTful web services

RESTful web services, which are declarative, lightweight and easy to access, are already widely used for exposing services on the internet and have attracted increasing interest from industry. The rising number of services being implemented and made available on the web is creating a demand for modelling techniques that can abstract REST design from the implementation in order to better specify, analyse and implement large-scale RESTful web systems. It can also help by providing suitable RESTful web service composition methods which can reduce costs by efficiently re-using the large number of services that are already available and by exploiting existing services for complex business purposes. This paper introduces a formal model of RESTful web services in linear logic and proposes a formal method approach for RESTful web service composition based on planning using linear logic via theorem proving. This is a two-stage planning method that finds resources for the composition at both the abstract resource and the service operation levels. It greatly improves the searching efficiency and guarantees the correctness and completeness of the service composition process. The paper demonstrates a further validation of the planning method through its implementation in the interactive Coq logic proof assistant.

Architecture based Comparison of Semantic Web Service Composition Processes

ABSTRACT Semantic web services development become rapidly increased as dynamic changes are occurred. Various approaches are adopted to develop composite service systematically. This paper aims to make development process easier by classifying the literature on web services composition based approaches like selection, discovery, orchestration, choreography, mediation, automatic composition to facilitate the end to end semantic web service composition easier. Applying semantics in web process cycle helps to address critical issues in reuse, integration and scalability. In order to find best approach, various composition approaches on these requirements were evaluated and suggestions were provided on what approach can be used in which scenario to achieve best results. Keywords Semantic web service, Service Composition approaches, Selection, Discovery, Orchestration, Choreography. 1. INTRODUCTION Semantic web is an extension of current web, in which information is given well defined meaning, better enabling computer and people to work in cooperation [1]. The objective of used to find services available for clients input request and research around semantic web service is to facilitate automatic handling of web services. Semantic web transforms the web into repository of computer readable data, while web services provide tool for automatic reuse of that data. Sometimes single service component unable to satisfy user needs then some mechanisms like discovery [4], selection [18], mediation [12], matchmaking etc. are used for finding service component and semantic composition helps to aggregate the component of various services according to tasks. In previous work we have made a survey on different approaches of semantic web services [18]. The main objective of this paper is to discuss some existing composition techniques like Workflow based, Artificial Planning, Context based, Agent based, Ontology based, Orchestration and Choreography to solve semantic web composition problem with their attributes. In addition, we have also classified and compared different web service composition methods. Apart from introduction part, section 2 deals with various composition based method for semantic web service, section 3 covers framework of service composition methods, section 4 covers classification and comparison among several approaches and conclusion in section 5.

Reliable Web service composition based on QoS dynamic prediction

Web service dynamic composition is a key technology for creating value-added services by composing available services and applications. With the rapid development of web service, cloud computing, big data and internet of things, more and more services with identical functionality and different Quality of Service (QoS) are available; moreover, QoS of Web services are highly dynamic, so, how to create composite Web services reliably and efficiently is still an open issue. For this problem, this paper proposes a reliable Web service composition method based on global QoS constraints decomposition and QoS dynamic prediction. The approach includes two critical phases: firstly, before service composition, global QoS constraints are decomposed into local constraints, and the problem of Web service dynamic composition is transformed to a local optimization problem; secondly, during the running time, optimal Web service is selected for the current abstract service based on predicted QoS values. Experiment results show that our approach can greatly enhance the reliability of composite Web service.

Dynamic composition of Web services using efficient planners in large-scale service repository

Web services as independent software components are published by service providers over the Internet and invoked by service requesters for their desired functionalities. In many cases, however, there is no single service in a Web service repository satisfying a service request. So how to design an efficient method for composing a chain of connected services has become an important research issue. Recently, much research has been done into the search time reduction when finding a composite service. However, most methods take a long time for traversing all of the Web services in a service repository, thus it makes their response time significantly overrun a user’s waiting patience. This paper develops an efficient approach for automatic composition of Web services using the state-of-the-art Artificial Intelligence (AI) planners, where a Web service composition (WSC) problem is regarded as a WSC planning problem. Unlike most traditional WSC methods that traverse a Web service repository many times, our approach converts a Web service repository into a planning domain in PDDL just once, which will only be regenerated when the Web service repository changes. This treatment substantially reduces the response time and improves the scalability of solving WSC problems. We have implemented a prototype system and conducted extensive experiments on large-scale Web service repositories. The experimental results demonstrate that our proposed approach outperforms the state-of-the-art.

An Optimized Semantic Web Service Composition Method Based on Clustering and Ant Colony Algorithm

In today’s Web, Web Services (WSs) are created and updated on the fly Nowadays, for answering complex needs of users, the construction of new web services based on existing ones is required. It has received a great attention from different communities. This problem is known as web services composition. However, it is one of big challenge problems of recent years in a distributed and dynamic environment. Web services can be composed manually but it is a time consuming task. The automatic web service composition is one of the key features for future the semantic web. The various approaches in field of web service compositions proposed by the researchers. In this paper, we propose a novel architecture for semantic web service composition using clustering and Ant colony algorithm.

Score distribution method for Web service composition

To distribute the score of composite service obtained from customer to each component service based on actual and historical performance of component services, Analytic Hierarchy Process( AHP) was used to calculate the distribution weight of each component service, in which a method was presented to convert Web service process into structure tree process,and the weight matrix was used to calculate the weight of each node in the tree structure. The relationship between actual Quality of Service( QoS) of component services and its advertised utility interval of QoS were taken into consideration, and through deviation function, the deviation proportion between actual QoS utility value of component service and actual QoS average utility value of all component services was calculated, meanwhile the influence on score distribution by history performance of each component service was considered. The experimental results show that actual QoS and history performance of component services have some influence on score which was distributed, and demonstrate that the proposed approach can achieve a reasonable and fair score distribution.

Web service composition method based on community service chain

A new Web service composition method based on service communities and service chains was proposed in this paper to improve the time efficiency of service composition.In the method,a service network was constructed for the Web service collection,the service community discovery algorithm based on information center was applied to find service clubs in the service network,and then the community service chain discovery algorithm and Web service composition algorithm based on service chain were built.With these algorithms,all of service interface associations in a service club were changed into service chains,and the Web service composition process based on community service chains and Quality of Service(QoS) pruning was implemented.The experimental results indicate that,compared with the traditional service composition method based on graph depth traversal,the response time on five test sets in the service composition method with community service chains is on average improved by 42%,and up to 67%.Community service chains can effectively reduce the service search space for the current service request and improve the time efficiency of service composition.