WSC-2009: A Quality of Service-Oriented Web Services Challenge

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

doi:10.1109/cec.2009.80

Cited by 69 publications

(43 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…S k ) the subset of data i (resp. service i) belonging to L at the kth iteration of the while loop (lines [9][10][11][12][13][14][15][16][17][18][19][20][21][22][23][24][25]. For all i ∈ D k ∪ S k , λ(i) equals to the optimal path value from s 0 to i on throughput criterion denoted v t (µ * (i)).…”

Section: Proof 1 the Proof Is By Induction On The Following Propertymentioning

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

Section: Proof 1 the Proof Is By Induction On The Following Propertymentioning

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

show abstract

“…For QoS, as we mentioned, we focus only on the more commonly used quality criteria, namely, response time and throughput:  Response time Q RT (w): the time interval between the moment when a request is sent and the moment when the results are received [34]  Throughput Q TH (w): is the number of successful invocations over a specified period [14].…”

Section: Convertedamount: Concept = Moneymentioning

confidence: 99%

“…The data sets consider two QoS criteria, namely, response time and throughput. We thus used the ten (10) data sets of Web Service Challenge WSC '10 [1] (the same five (05) data sets of WSC09 [14] with other larger scale test data sets [29]) in our experiment. The number of services in our data sets ranges from 500 to 20,000, while the number of concepts ranges from 5,000 to 100,000 [29].…”

Section: Implementation and Evaluationmentioning

confidence: 99%

Automated Web Service Composition Algorithm Based on Improved Planning Graph

Bali¹,

Kazar²,

Gherbi³

2017

IJSEIA

View full text Add to dashboard Cite

show abstract

“…We use the test generator program from the WSC-2009 web-service challenge [17] to generate five datasets and evaluate our work. Each dataset contains a WSDL file which is the repository of web services.…”

Section: A Datasetmentioning

confidence: 99%

Scaling Up Web Service Composition with the Skyline Operator

Yan

Lemire

2016

2016 IEEE International Conference on Web Services (ICWS)

View full text Add to dashboard Cite

Abstract-Web service composition enables the provision of existing resources on the web without investing in new infrastructure. However, searching an optimal composition solution with both functional and non-functional requirements is a computationally demanding problem: the time and space requirements may be insufferable due to the high number of available services. To alleviate this problem, we propose the application of a skyline operation to reduce the search space and improve the scalability.We design a system to solve the composition problem with two separate processes. The Graphplan approach finds a solution in a short time, the database approach may take longer time to find a solution, but the solution returned by this approach always has fewer redundant services with a better QoS value. Full Solution Indexing using Database (FSIDB) approach pre-computes all services combinations and store them as paths in a database. Partial pre-composing approach chooses "popular" paths generated by FSIDB approach and store them in a separate table. If the problem can be solved by these paths, there is no need to search the table with whole paths. We evaluate our approach with a web service challenge dataset.

show abstract

WSC-2009: A Quality of Service-Oriented Web Services Challenge

Cited by 69 publications

References 5 publications

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

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

Automated Web Service Composition Algorithm Based on Improved Planning Graph

Scaling Up Web Service Composition with the Skyline Operator

Contact Info

Product

Resources

About