A Theory of QoS for Web Service Orchestrations

While extensive foundational work exist for the functional aspects of Web service orchestrations, very little exists regarding the foundations of Service Level Agreements (SLA), Service Level Specifications (SLS), and more generally Quality of service (QoS) issues. In this paper we develop a comprehensive theory of QoS for Web service Orchestrations. To support multi-dimensional or composite QoS parameters, QoS domains must be partially, not totally, ordered. We identify the needed algebra to capture how QoS get transformed when synchronising service responses and to represent how a service call contributes to the end-to-end QoS of the orchestration. SLA/SLS approaches implicitly assume that, the better a called service performs, the better the orchestration does. This property, called monotonicity, does not always hold, however. We provide conditions ensuring it. Then we show how SLA or contracts between the orchestration and the services it calls can be composed to derive an SLA or contract between the orchestration and its clients. To account for high variability in measured QoS parameters for existing Web services, we support both probabilistic and non-probabilistic approaches. Finally, we propose a mild extension of the Orc language for service orchestrations to support flexible QoS management according to our theory.

[1]  Wil M. P. van der Aalst,et al.  Formal semantics and analysis of control flow in WS-BPEL , 2007, Sci. Comput. Program..

[2]  Albert Benveniste,et al.  Flexible Probabilistic QoS Management of Transaction Based Web Services Orchestrations , 2009, 2009 IEEE International Conference on Web Services.

[3]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[4]  Kunal Verma,et al.  Constraint driven Web service composition in METEOR-S , 2004, IEEE International Conference onServices Computing, 2004. (SCC 2004). Proceedings. 2004.

[5]  Albert Benveniste,et al.  True-concurrency probabilistic models: Branching cells and distributed probabilities for event structures , 2006, Inf. Comput..

[6]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[7]  Albert Benveniste,et al.  Probabilistic QoS and Soft Contracts for Transaction-Based Web Services Orchestrations , 2008, IEEE Transactions on Services Computing.

[8]  Carlos Delgado Kloos,et al.  Applying model checking to BPEL4WS business collaborations , 2005, SAC '05.

[9]  Anne H. H. Ngu,et al.  QoS-aware middleware for Web services composition , 2004, IEEE Transactions on Software Engineering.

[10]  Jayadev Misra,et al.  Computation Orchestration , 2007, Software & Systems Modeling.

[11]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[12]  Marco Ajmone Marsan,et al.  The Effect of Execution Policies on the Semantics and Analysis of Stochastic Petri Nets , 1989, IEEE Trans. Software Eng..

[13]  Heiko Ludwig,et al.  The WSLA Framework: Specifying and Monitoring Service Level Agreements for Web Services , 2003, Journal of Network and Systems Management.

[14]  Albert Benveniste,et al.  Monotony in Service Orchestrations , 2008, ArXiv.

[15]  T. Kamae,et al.  Stochastic Inequalities on Partially Ordered Spaces , 1977 .