IDEAS home Printed from https://ideas.repec.org/a/igg/jwsr00/v2y2005i1p1-17.html
   My bibliography  Save this article

Dynamic Workflow Composition: Using Markov Decision Processes

Author

Listed:
  • Prashant Doshi

    (University of Illinois at Chicago, USA)

  • Richard Goodwin

    (IBM T.J. Watson Research Center, USA)

  • Rama Akkiraju

    (IBM T.J. Watson Research Center, USA)

  • Kunal Verma

    (University of Georgia, USA)

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, workflows generated by classical planning algorithms suffer from the paradoxical assumption of deterministic behavior of Web services, then requiring the additional overhead of execution monitoring to recover from unexpected behavior of services due to service failures, and the dynamic nature of real-world environments. To address these concerns, we propose using Markov decision processes (MDPs) to model workflow composition. To account for the uncertainty over the true environmental model, and for dynamic environments, we interleave MDP-based workflow generation and Bayesian model learning. Consequently, our method models both the inherent stochastic nature of Web services and the dynamic nature of the environment. Our algorithm produces workflows that are robust to non-deterministic behaviors of Web services and that adapt to a changing environment. We use a supply chain scenario to demonstrate our method and provide empirical results.

Suggested Citation

  • Prashant Doshi & Richard Goodwin & Rama Akkiraju & Kunal Verma, 2005. "Dynamic Workflow Composition: Using Markov Decision Processes," International Journal of Web Services Research (IJWSR), IGI Global, vol. 2(1), pages 1-17, January.
  • Handle: RePEc:igg:jwsr00:v:2:y:2005:i:1:p:1-17
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jwsr.2005010101
    Download Restriction: no
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Issam Alhadid & Sufian Khwaldeh & Mohammad Al Rawajbeh & Evon Abu-Taieh & Ra’ed Masa’deh & Ibrahim Aljarah, 2021. "An Intelligent Web Service Composition and Resource-Optimization Method Using K-Means Clustering and Knapsack Algorithms," Mathematics, MDPI, vol. 9(17), pages 1-16, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jwsr00:v:2:y:2005:i:1:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.