2012
DOI: 10.1007/978-3-642-31095-9_31
|View full text |Cite
|
Sign up to set email alerts
|

Towards Proactive Web Service Adaptation

Abstract: Abstract. With the rapid development of web service technology, next generations of web service applications need to be able to predict problems, such as potential degradation scenarios, future erroneous behaviors and deviations from expected behaviors, and move towards resolving those problems not just reactively, but even proactively, i.e., before the problems occur. Service oriented applications are thus driven by the requirements that bring the concepts of decentralization, dynamism, adaptation, and automa… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2015
2015
2024
2024

Publication Types

Select...
5
2
2

Relationship

1
8

Authors

Journals

citations
Cited by 11 publications
(6 citation statements)
references
References 17 publications
(21 reference statements)
0
5
0
Order By: Relevance
“…In the proposed algorithm, i.e., Algorithm 3, an action, i.e., Web service, is selected, based on the dominance relation between the Q-vectors, following the -greedy exploration strategy (Lines 1-6). Then, instead of repeatedly backing up the maximal expected rewards, i.e., as in the single objective case [13], it backs up the set of expected rewards that are maximal for some set of linear preferences (Lines 7-10).…”
Section: Multiple Policy Multi-objective Service Compositionmentioning
confidence: 99%
See 1 more Smart Citation
“…In the proposed algorithm, i.e., Algorithm 3, an action, i.e., Web service, is selected, based on the dominance relation between the Q-vectors, following the -greedy exploration strategy (Lines 1-6). Then, instead of repeatedly backing up the maximal expected rewards, i.e., as in the single objective case [13], it backs up the set of expected rewards that are maximal for some set of linear preferences (Lines 7-10).…”
Section: Multiple Policy Multi-objective Service Compositionmentioning
confidence: 99%
“…The values of these learning parameters are decided based on previous empirical simulations conducted by the authors [13] as follows. The learning rate α is set to 1, the discount factor γ is set to 0.8 and the -greedy exploration strategy value is set to 0.7.…”
Section: Experiments Settingmentioning
confidence: 99%
“…However, their approach is contingent on the service provider; also, the author did not discuss the various hidden states or probabilistic insight of remote web services. Moustafa et al [23] proposed a proactive approach to web services composition (WSC), which uses the Markov Decision Process (MDP) to model WSC process and uses Q-learning for a Reinforcement Learning technique to adapt to dynamic change in the WSC environments proactively. This approach monitors the WSC to determine proactive adaptation by analyzing the web service execution log's historical data.…”
Section: Related Workmentioning
confidence: 99%
“…To adapt dynamically to composition environment, reinforcement policy is used in [10] to get optimal workflow. ProAdapt, is a framework that uses proactive adaptation of web services using exponentially weighed moving averages based upon prediction [4].…”
Section: Related Workmentioning
confidence: 99%