Name
Abstract | ||
|---|---|---|
Due to the highly dynamic nature of services (web services can enter or leave the system at any time, or change their characteristics), adaptation to change during service composition is necessary to meet user needs. Yet current approaches to change handling detect quality violations and service unavailability only after their occurrence (after executing the corresponding service), resulting in undesired situations at execution time from which recovery (usually through costly replanning) might not always be possible. In response, this paper presents a novel reactive selection algorithm, which adapts to changes in the environment efficiently while performing the selection, ensuring that the selected composite service is executable, satisfactory and optimal prior to execution. The algorithm's effectiveness is demonstrated via experimental results. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1007/978-3-642-33427-6_2 | ESOCC |
Keywords | Field | DocType |
selected composite service,novel reactive selection algorithm,execution time,reactive service selection,service unavailability,corresponding service,web service,dynamic nature,costly replanning,service composition,dynamic service environment,current approach,quality of service | Best-effort delivery,Computer science,Selection algorithm,Quality of service,Service composition,Real-time computing,Unavailability,Service level requirement,Web service,Distributed computing,Executable | Conference |
Citations | PageRank | References |
4 | 0.42 | 13 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lina Barakat | 1 | 55 | 8.00 |
| Simon Miles | 2 | 1599 | 109.29 |
| Michael Luck | 3 | 3440 | 275.97 |