Semantic Web Service Composition: The Web Service Challenge Perspective

Weise, Thomas; Blake, M. Brian; Bleul, Steffen

doi:10.1007/978-1-4614-7518-7_7

Cited by 13 publications

(17 citation statements)

References 119 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%

“…Moreover, it exists standard synthetic data benchmarks, as the Web Service Challenge (WSC) one. 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].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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%

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

show abstract

“…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

“…Many papers have discussed semantic matching, when advertisement and request use the same ontology but an approach based on using a unique ontology is not rational because it requires that every service provider and requestor should adhere to the same ontology, an assumption which is improbable. In open distributed computing environment available mechanisms for semantic service discovery face new challenges such as increasing scale of systems and multiple coexisting ontologies [2] [3]. Semantic alignment mechanisms need to be purposefully integrated into a service discovery framework in order to fully exploit its potential.…”

Section: Introductionmentioning

confidence: 99%

Web Services Matchmaking Based on a Partial Ontology Alignment

Fellah¹,

Malki²,

Elçi³

2016

IJITCS

View full text Add to dashboard Cite

Abstract-The fast development and the huge number of existing web services have raised the problem of the urgent need for matchmaking mechanisms. However state-of-the-art matchmakers are unsuitable for locating web services that use different ontologies. This aspect is important since it is not realistic to assume that Web services will always be defined by the same ontology, as the Web service requester and provider operate independently, each defines their own ontologies to describe their services. This is an emergent research issue that has not been well addressed. This work is a contribution to achieve semantic interoperability in a multi-ontology environment. This paper describes a Web service multi-ontology matchmaker for SAWSDL services, called SAWSDL-MOM which locates web services that use different ontologies. The matchmaker engine incorporates a novel partial ontology alignment algorithm with syntax, linguistic and original structural matchers. In determining the 1:1 mappings the Hungarian algorithm is used. Finally a matchmaking strategy is utilized in finding the score of each service. Experimental evaluation and comparison provide strong evidence that SAWSDL-MOM can significantly improve results, achieve better interoperability and scalability.

show abstract

Semantic Web Service Composition: The Web Service Challenge Perspective

Cited by 13 publications

References 119 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

Web Services Matchmaking Based on a Partial Ontology Alignment

Contact Info

Product

Resources

About