Tradeoff between executing time and revenue for runtime service composition

Abstract

Given a service composition, it is challenging but important to have a runtime adaptation, due to the complicated execution environment and evolving feature of Web service. In this paper, we present a runtime adaptive service composition approach, taking execution time minimization and revenue maximization into consideration. Based on dynamic programming, we deduce the optimal policy. Through this policy, orchestrator selects one concrete service for per task on runtime. The experimental results show that the proposed approach outperforms previous approach.