Towards Data-Aware QoS-driven Adaptation for Service Orchestrations

Several activities in service oriented computing can benefit from knowing properties of a given service composition ahead of time. We will focus here on properties related to computational cost and resource usage, in a wide sense, as they can be linked to QoS characteristics. In order to attain more accuracy, we formulate computational cost / resource usage as functions on input data (or appropriate abstractions thereof) and show how these functions can be used to make more informed decisions when performing composition, proactive adaptation, and predictive monitoring. We present an approach to, on one hand, automatically synthesize these functions from orchestrations and, on the other hand, to effectively use them to increase the quality of non-trivial service-based systems with data-dependent behavior. We validate our approach by means of simulations with runtime selection of services and adaptation due to service failure.

[1]  Hui Lei,et al.  Monitoring the QoS for Web Services , 2007, ICSOC.

[2]  Thomas Risse,et al.  Combining global optimization with local selection for efficient QoS-aware service composition , 2009, WWW '09.

[3]  Jorge Cardoso,et al.  About the Data-Flow Complexity of Web Processes , 2005 .

[4]  Wil M. P. van der Aalst,et al.  DecSerFlow: Towards a Truly Declarative Service Flow Language , 2006, WS-FM.

[5]  Elvira Albert,et al.  Cost Relation Systems: A Language-Independent Target Language for Cost Analysis , 2009, PROLE.

[6]  Jorge A. Navas,et al.  A Flexible, (C)LP-Based Approach to the Analysis of Object-Oriented Programs , 2008, LOPSTR.

[7]  Manuel V. Hermenegildo,et al.  Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor) , 2005, Sci. Comput. Program..

[8]  Jorge A. Navas,et al.  User-Definable Resource Bounds Analysis for Logic Programs , 2007, ICLP.

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

[10]  Jorge S. Cardoso,et al.  Complexity analysis of BPEL Web processes , 2007, Softw. Process. Improv. Pract..

[11]  Saumya K. Debray,et al.  Cost analysis of logic programs , 1993, TOPL.

[12]  Hans-Wolfgang Loidl,et al.  Cost Analysis Using Automatic Size and Time Inference , 2002, IFL.

[13]  Jakob Engblom,et al.  The worst-case execution-time problem—overview of methods and survey of tools , 2008, TECS.

[14]  Dragan Ivanovic,et al.  An Initial Proposal for Data-Aware Resource Analysis of Orchestrations with Applications to Predictive Monitoring , 2009, ICSOC/ServiceWave Workshops.

[15]  Jorge A. Navas,et al.  User-Definable Resource Usage Bounds Analysis for Java Bytecode , 2009, BYTECODE@ETAPS.

[16]  Saumya K. Debray,et al.  Task granularity analysis in logic programs , 1990, PLDI '90.

[17]  Maria Luisa Villani,et al.  An approach for QoS-aware service composition based on genetic algorithms , 2005, GECCO '05.

[18]  Francisco Curbera,et al.  Web Services Business Process Execution Language Version 2.0 , 2007 .

[19]  Saumya K. Debray,et al.  Lower Bound Cost Estimation for Logic Programs , 1997, ILPS.

[20]  Manuel V. Hermenegildo,et al.  An Overview of the Ciao Multiparadigm Language and Program Development Environment and Its Design Philosophy , 2008, Concurrency, Graphs and Models.