Automatic Web Service Composition with a Heuristic-Based Search Algorithm

Rodríguez-Mier, Pablo; Mucientes, Manuel; Lama, Manuel

doi:10.1109/icws.2011.89

Cited by 94 publications

(49 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Rodriguez-Mier et al [123] used A* to search through a service dependency graph and generate an optimal composition in terms of the number of web services comprising it. In Rodríguez-Mier et al [108] an optimal and complete backward search method was used to generate multiple optimal solutions to WSC problems, without taking into consideration their non-functional properties.…”

Section: Middle Ground Methodsmentioning

confidence: 99%

Non-deterministic planning methods for automated web service composition

Markou

Refanidis

2015

AIR

View full text Add to dashboard Cite

Web service composition (WSC) is the task of generating new composite web services that exhibit functionalities not supported by any single web service. In its simplest form this is achieved by linking existing web services in sequence. More complex forms link services in parallel or use alternative paths. WSC can be considered a planning task, with the web services being the planning operators and the initial state and the goals being provided by the user. Particularly, since web services operate in a stochastic environment, their output is not predictable, and the problem is formulated as a non-deterministic planning one. This article presents a critical, comprehensive and up-to-date review of the literature concerning alternative non-deterministic planning methods, including probabilistic planning, determinization methods, planning in the belief state space and translationbased methods. Furthermore, the article reviews existing implementations of WSC systems, employing a variety of planning approaches, and discusses the degree in which the current achievements from the non-deterministic planning field have been adopted successfully. To the best of our knowledge, this is the first review of its kind, one that provides a thorough introduction to the vast area of automated web service composition.

show abstract

Section: Middle Ground Methodsmentioning

confidence: 99%

Non-deterministic planning methods for automated web service composition

Markou

Refanidis

2015

AIR

View full text Add to dashboard Cite

show abstract

“…This problem is studied by Mier, Mucientes and Lama in [17] which they propose an approach using an optimistic heuristic to reduce the number of possible paths to explore the WSc.…”

Section: Related Workmentioning

confidence: 99%

Minimum Unsatisfiability based QoS Web Service Composition over the Cloud Computing

Wakrime

Jabbour

2015

2015 15th International Conference on Intelligent Systems Design and Applications (ISDA)

View full text Add to dashboard Cite

Cloud Computing based Software as a Service (SaaS) combines multiple Web Services in order to satisfy a SaaS request. SaaS is based on Service Oriented Architectures and Web Service technology which are popular paradigm to design new generation of applications. These functionalities are published on the Internet, but exploiting rigorously a large data stream in order to use Web Services is a complicated and laborious task which may involve error prone. In this paper we investigate the problem of SaaS Web Service Composition. We present a new technique that combines an encoding into SAT and a Minimal Unsatisfiability Subformulas extraction to obtain the minimum SaaS Web Service Composition.Furthermore, we generalize this approach to take into account the quality of SaaS Web Service.

show abstract

“…Many in-memory approaches based on different kinds of techniques are used to solve the composition problem. These include A* methods [8], [9], [10], beam-stack search [11] and planning-graph model [12], [13]. A planning-graph approach is a powerful method to solve the composition problem.…”

Section: ) a Tourist Wants To Travel From Montreal To Chicagomentioning

confidence: 99%

Full Solution Indexing for Top-K Web Service Composition

Yan

Lemire

2018

IEEE Trans. Serv. Comput.

View full text Add to dashboard Cite

Abstract-Automated service composition fulfills complex tasks by combining different existing web services together. Unfortunately, optimizing service composition is still a challenging area that needs to be addressed. In this article, we propose a novel relational database approach for automated service composition. All possible service combinations are generated beforehand and stored in a relational database. When a user request comes, our system composes SQL queries to search in the database and return the best Quality of Service (QoS) solutions. We test the performance of the proposed system with a web service challenge data set. Our experimental results demonstrate that this system can always find top-K valid solutions to satisfy user's functional and non-functional requirements.

show abstract

Automatic Web Service Composition with a Heuristic-Based Search Algorithm

Cited by 94 publications

References 12 publications

Non-deterministic planning methods for automated web service composition

Non-deterministic planning methods for automated web service composition

Minimum Unsatisfiability based QoS Web Service Composition over the Cloud Computing

Full Solution Indexing for Top-K Web Service Composition

Contact Info

Product

Resources

About