Effective Web Service Composition in Diverse and Large-Scale Service Networks

Abstract

Abstract-Web services are considered to be a potential silver bullet for the envisioned Service Oriented Architecture, in which loosely coupled software components are published, located, and executed as integral parts of distributed applications. The main research focus of Web services is to achieve the interoperability between distributed and heterogeneous applications. Therefore, flexible composition of Web services to fulfill the given challenging requirements is one of the most important objectives in this research field. However, until now, service composition has been largely an error-prone and tedious process. Furthermore, as the number of available Web services increases, finding the right Web services to satisfy the given goal becomes intractable. In this paper, toward these issues, we propose an AI planning-based framework that enables the automatic composition of Web services, and explore the following issues. First, we formulate the Web service composition problem in terms of AI planning and network optimization problems to investigate its complexity in detail. Second, we analyze publicly available Web service sets using network analysis techniques. Third, we develop a novel Web service benchmark tool called WSBen. Fourth, we develop a novel AI planning-based heuristic Web service composition algorithm named WSPR. Finally, we conduct extensive experiments to verify WSPR against state-of-the-art AI planners. It is our hope that both WSPR and WSBen will provide useful insights for researchers to develop Web service discovery and composition algorithms, and software.

Data-Driven Service Composition in Enterprise SOA Solutions: A Petri Net Approach

“…Even when no feasible one is derived, in the decomposed nets we can find fragments that may be relevant to a final solution. Future work includes building a more comprehensive data model to derive better solutions, and validating our approach via service libraries such as ITIL (Information Technology Infrastructure Library) and SCOR (Supply-Chain Operations Reference-model), or artificially generated large-scale service networks [12]. Our work does not address how the generated Petri nets are to be executed in a workflow engine.…”

“…For simplicity, we omit the unrelated data/relations so that in the next step RSN equals SN. The operation and mediation transitions are explained as follows: mt 11 , mt 12 Mediation transition, to classify order into two subtypes, i.e., ADSL order (adsl_order) and new-telephone-line order (nl_order).…”

QoS-aware automatic syntactic service composition problem: Complexity and resolution

“…They induce much more difficult optimization problems. Indeed in [10], [19], authors show that the service composition problem is NP-hard when a sum-type criterion (e.g number of services or cost) is minimized. In [10], the proof is based on a reduction to the set cover problem.…”

“…For each service j whose label became definitive at the previous step, consider each data i belonging to out(j) and refresh its label as follows (lines [15][16][17][18][19][20][21][22]:…”

An approach towards adaptive service composition in markets of composed services

“…The majority of existing composition approaches can be considered as symbolic techniques that base on explicitly given information [5][6][7][8][9][10][11][12][13][14][15]. Alternatively, machine learning techniques are proposed to replace symbolic techniques (cf.…”