Web Services Foundations 2013
DOI: 10.1007/978-1-4614-7518-7_13
|View full text |Cite
|
Sign up to set email alerts
|

Service Selection in Web Service Composition: A Comparative Review of Existing Approaches

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
45
0
4

Year Published

2015
2015
2018
2018

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 76 publications
(49 citation statements)
references
References 53 publications
0
45
0
4
Order By: Relevance
“…Each variable has a domain consisting of all possible values that the variable can take and a set of constraints, assigning a value to a variable. One of the solutions of such a problem [35] is to assign to each variable value from its domain that satisfies all constraints. The work in [39] propose a composition process modeled as a Constraint Optimization Problem (COP).…”
Section: Constraint Satisfaction Methodsmentioning
confidence: 99%
“…Each variable has a domain consisting of all possible values that the variable can take and a set of constraints, assigning a value to a variable. One of the solutions of such a problem [35] is to assign to each variable value from its domain that satisfies all constraints. The work in [39] propose a composition process modeled as a Constraint Optimization Problem (COP).…”
Section: Constraint Satisfaction Methodsmentioning
confidence: 99%
“…Therefore, the selection of the optimal atomic service to be combined with other services to perform complex composite service with the most satisfaction of QoS values is one of the significant requirements for service composition [35].…”
Section: Service Selectionmentioning
confidence: 99%
“…Figure 3 shows an example on how the dependability data points can be re-plotted according to the timeslots. Assume that a service VS i was used six times in different days and assume that two out of these six times were during the timeslot [6][7], two during [7][8], one during [16][17], and one during [17][18][19]. Figure 3(a) shows how the data points are plotted in the 'classical'.…”
Section: ) Vs Dependabilitiesmentioning
confidence: 99%
“…That is, a distributed application consists of some number of distributed services that are composed together in order to provide the required functionality [8]. In VC, similar concepts can be applied on volunteered storage when considering this storage as a volunteered service (VS).…”
Section: Introductionmentioning
confidence: 99%