2010
DOI: 10.1007/978-3-642-17358-5_30
|View full text |Cite
|
Sign up to set email alerts
|

Heuristic Approaches for QoS-Based Service Selection

Abstract: In a Service Oriented Architecture (SOA) business processes are commonly implemented as orchestrations of web services, using the Web Services Business Process Execution Language (WS-BPEL). Business processes not only have to provide the required functionality, they also need to comply with certain Quality-of-Service (QoS) constraints which are part of a service-level agreement between the service provider and the client. Different service providers may offer services with the same functionality but different … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
19
0

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
3

Relationship

2
6

Authors

Journals

citations
Cited by 22 publications
(19 citation statements)
references
References 7 publications
0
19
0
Order By: Relevance
“…The QoSWSC problem can be stated as finding the 39 bindings that meet all the QoS constraints and maxi-40 mize or minimize certain user-defined optimization cri- 41 teria, e.g. minimize cost.…”
mentioning
confidence: 99%
“…The QoSWSC problem can be stated as finding the 39 bindings that meet all the QoS constraints and maxi-40 mize or minimize certain user-defined optimization cri- 41 teria, e.g. minimize cost.…”
mentioning
confidence: 99%
“…If a third party rejects the Evolution Request or if it is not available anymore, the Evolution Coordination can start a search for suitable services. To this end, we will adopt our service selection algorithms proposed in [7].…”
Section: Evolution Coordinationmentioning
confidence: 99%
“…In the event of pure Web service selection for business processes, this issue can be solved by our approach in the paper [7] or by other popular approaches like integer linear programming [24] and genetic algorithms [6].…”
Section: Optimization Problemmentioning
confidence: 99%
“…Selecting the right concrete services for the composition is known as the service selection problem and is known to be NP-hard [9]. We give a short insight of how we handled this problem in section 3.1 and further details can be found in [4]. In Figure 1 we consider a simple BPEL tree for illustration purposes.…”
Section: Service Composition Representationmentioning
confidence: 99%
“…For brevity reasons we only present a rough sketch of OP T IM P RO in this paper. Further details about the selection algorithms can be found in [4]. OP T IM P RO is an iterative algorithm and improves the variant found on the root node (the objective value of the variant) with each iteration step.…”
Section: Bprules Featuresmentioning
confidence: 99%