Dynamic workflow composition using Markov decision processes
Prashant Doshi,Richard Goodwin,Rama Akkiraju,Kunal Verma +3 more
- 06 Jun 2004
- pp 576-582
90
TL;DR: This work proposes using Markov decision processes (MDPs), to model workflow composition, and demonstrates the resulting workflows are robust to nondeterministic behaviors of Web services and adaptive to a changing environment.
read more
Abstract: The advent of Web services has made automated workflow composition relevant to Web based applications. One technique, that has received some attention, for automatically composing workflows is AI-based classical planning. However, classical planning suffers from the paradox of first assuming deterministic behavior of Web services, then requiring the additional overhead of execution monitoring to recover from unexpected behavior of services. To address these concerns, we propose using Markov decision processes (MDPs), to model workflow composition. Our method models both, the inherent stochastic nature of Web services, and the dynamic nature of the environment. The resulting workflows are robust to nondeterministic behaviors of Web services and adaptive to a changing environment. Using an example scenario, we demonstrate our method and provide empirical results in its support.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
MDP and Machine Learning-Based Cost-Optimization of Dynamic Resource Allocation for Network Function Virtualization
Runyu Shi,Jia Zhang,Wenjing Chu,Qihao Bao,Xiatao Jin,Chenran Gong,Qihao Zhu,Chang Yu,Steven Rosenberg +8 more
- 27 Jun 2015
TL;DR: Markov Decision Process (MDP) is applied to the NP-hard problem to dynamically allocate cloud resources for NFV components and Bayesian learning method is applications to monitor the historical resource usage in order to predict future resource reliability.
91
Markov-HTN Planning Approach to Enhance Flexibility of Automatic Web Service Composition
Kun Chen,Jiuyun Xu,Stephan Reiff-Marganiec +2 more
- 06 Jul 2009
TL;DR: A model of combining a Markov decision process model and HTN planning to address Web services composition is proposed and it is shown that the proposed approach works effectively.
88
Automatic Composition of Semantic Web Services Using Process and Data Mediation
Zixin Wu,Ajith Ranabahu,Karthik Gomadam,Amit P. Sheth,John A. Miller +4 more
- 01 Jan 2007
TL;DR: This paper presents a planning-based approach to solve both the process heterogeneity and data heterogeneity problems in Web service composition and successfully outputs an executable BPEL file which correctly solves non-trivial real-world process specifications outlind in the 2006 SWS Challenge.
•Proceedings Article
Planning for stream processing systems
Anton V. Riabov,Zhen Liu +1 more
- 09 Jul 2005
TL;DR: This paper exlend the classical planning formalism by introducing new language constructs that support the structure of stream processing domains, and shows exponential planning time reduction in comparison to most recent metric planners.
A multi-agent reinforcement learning approach to dynamic service composition
TL;DR: A distributed Q-learning algorithm is proposed, which decompose the task into many sub-tasks and make every agent focus on own sub-task, to accelerate the convergence rate and introduce experience sharing strategy to improve the efficiency.
72
References
•Book
Artificial Intelligence: A Modern Approach
Stuart Russell,Peter Norvig +1 more
- 01 Jan 2020
TL;DR: In this article, the authors present a comprehensive introduction to the theory and practice of artificial intelligence for modern applications, including game playing, planning and acting, and reinforcement learning with neural networks.
21.4K
Business Process Execution Language for Web Services Version 1.1
Tony Andrews
- 01 Jan 2003
TL;DR: The BPEL4WS specification defines an interoperable integration model that should facilitate the expansion of automated process integration in both the intracorporate and the business-to-business spaces.
1.9K
The Complexity of Markov Decision Processes
TL;DR: All three variants of the classical problem of optimal policy computation in Markov decision processes, finite horizon, infinite horizon discounted, and infinite horizon average cost are shown to be complete for P, and therefore most likely cannot be solved by highly parallel algorithms.
Composing Workflows of Semantic Web Services
Mikko Laukkanen,Heikki Helin +1 more
- 01 Jan 2004
TL;DR: This chapter introduces a workflow composer agent, which is able to compose Web service workflows, and more importantly, uses semantic descriptions of Web services in finding and matching Web services for a workflow.
79
•Book
Dynamic Programming
Richard Ernest Bellman
- 21 Oct 1957
TL;DR: The more the authors study the information processing aspects of the mind, the more perplexed and impressed they become, and it will be a very long time before they understand these processes sufficiently to reproduce them.
Related Papers (5)
Radu Sion,J. Tatemura +1 more
- 11 Jul 2005
Aiqiang Gao,Dongqing Yang,Shiwei Tang,Ming Zhang +3 more
- 11 Oct 2005
Sheila A. McIlraith,Tran Cao Son +1 more
- 01 Jan 2002