WSC-08: Continuing the Web Services Challenge

Bansal, Ajay; Blake, M. Brian; Kona, S.; Bleul, Steffen; Weise, Thomas; Jaeger, Michael C.

doi:10.1109/cecandeee.2008.146

Cited by 56 publications

(39 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The number of atomic processes has a higher variability, indicating that Fig. 6 Description of the web services compositions used for testing on repository OWL-S TC V2.2 6 These times have been obtained with an Intel Xeon(R) Quadcore E5320 1.86GHz processor with 8GB of RAM, and the algorithm was implemented in Java and run on Linux.…”

Section: Resultsmentioning

confidence: 99%

“…The algorithm uses a context-free grammar to limit the valid structures, takes into account the attributes updating, and minimizes both the number of services of the composite solution and the execution path needed to achieve the desired result. A full validation has been done in four different repositories: OWL-S TC [15], a handmade repository with 1,000 services, and three programgenerated repositories proposed for the 2008 Web Service Challenge of the EEE conference [6]. The behavior of the algorithm shows a great performance, as in all the cases a correct composition was found.…”

Section: Introductionmentioning

confidence: 96%

See 1 more Smart Citation

Composition of web services through genetic programming

et al. 2010

View full text Add to dashboard Cite

Web Services are interfaces that describe a collection of operations that are network-accessible through standardized web protocols. When a required operation is not found, several services can be compounded to get a composite service that performs the desired task. To find this composite service a search process in a, generally, huge search space must be performed. The algorithm that composes the services must select the adequate atomic processes and, also, must choose the correct way to combine them using the different available control structures. In this paper a genetic programming algorithm for web services composition is presented. The algorithm has a context-free grammar to generate the valid structures of the composite services and, also, it includes a method to update the attributes of each node. Moreover, the proposal tries to minimize the number of services, and looks for compositions with the minimum execution path. A full experimental validation with four different repositories with up to 1,090 web services has been done, showing a great performance in all the tests as the algorithm finds a valid solution with a short execution path.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

Composition of web services through genetic programming

et al. 2010

View full text Add to dashboard Cite

show abstract

“…In Rodríguez-Mier et al [108] the WSC algorithm's performance was evaluated based on problems from the Web Service Challenge 2008; [124] optimal solutions were generated in all cases, with the optimizations improving the method's efficiency substantially. The method does not support alternative flows and requires a pre-computed table mapping inputs to the web services that require them.…”

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

“…As shown in [24], WSC proposes an incremental synthetic data benchmark. In 2005, it only focuses on syntactic web service composition, then it integrates OWL for Taxonomy in 2007, and structured data types in 2008 [3], and finally it introduces QoS criteria (execution time and throughput) in 2009 [14]. These benchmarks are still used by recent approaches.…”

Section: Introductionmentioning

confidence: 99%

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

Gabrel

Manouvrier

Moreau

et al. 2018

Future Generation Computer Systems

View full text Add to dashboard Cite

Abstract-Automatic syntactic service composition problem consists in automatically selecting services, from a registry, by matching their input and output data. The composite service, resulting from this selection, allows producing a set of output data, needed by a user, from a set of input data, given by the user. Many approaches resolving the aforementioned problem do experimentations on the well-known Web Service Challenge (WSC) standard benchmark, which provides synthetic services. Since 2009, this challenge has extended the syntactic service composite problem to a Quality-Of-Service (QoS) based one, by describing the synthetic services with execution time and throughput values. In this article, we propose an original formulation of the QoS-aware automatic syntactic service composition problem in terms of scheduling problem with AND/OR constraints, using a directed graph structure. For the WSC-09 benchmark (considering execution time and throughput QoS criteria), our exact algorithm outperforms the related work. We also analyse the complexity of optimizing other QoS criteria (cost and reliability) and exhibit polynomial cases.

show abstract

WSC-08: Continuing the Web Services Challenge

Cited by 56 publications

References 3 publications

Composition of web services through genetic programming

Composition of web services through genetic programming

Non-deterministic planning methods for automated web service composition

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

Contact Info

Product

Resources

About