Terry G. Zhou
ABSTRACT
We present a semi-automated approach and framework for cost-aware recovery from service inconsistency arising due to unreliable service actions. A range of costs such as time are parameterised and modelled generically using cost algebras. With respect to a user-provided business specification, we distinguish end-state consistency, which must be achieved at service completion, from strong consistency, which may be momentarily violated. Our approach ensures optimal end-state consistency for services where action failure may lead to temporary violations of strong consistency or end-state consistency. Enterprises could not otherwise optimally and dynamically handle strong consistency violation, especially with respect to a variety of costs. Our approach provides quantitative analysis by defining a service model as an high-level message sequence chart (hMSC), annotating service actions with costs, then interpreting the model as a weighted (Mazurkiewicz) trace language, catering for costs in the presence of true concurrency. We devise a framework and method which checks such a model and ensures service end-state consistency optimally by concatenating the traces of recovery strategies (expressed by MSCs) from an enterprise service repository. We evaluate our approach using a popular online shop case study.
- B. Acu and W. Reisig. Compensation in workflow nets. Lecture Notes in Computer Science, 4024:65--83, 2006. Google Scholar
Digital Library
- T. Andrews et al. Business process execution language for web services, version 1.1. Standards proposal by BEA Systems, International Business Machines Corporation, and Microsoft Corporation, 2003.Google Scholar
- D. Beyer et al. Web service interfaces. In Proceedings of the 14th international conference on World Wide Web, pages 148--159. ACM New York, NY, USA, 2005. Google ScholarDigital Library
- D. Beyer et al. An application of web-service interfaces. 2007.Google Scholar
- R. Bruni, H. Melgratti, and U. Montanari. Theoretical foundations for compensations in flow composition languages. In Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 209--220. ACM New York, NY, USA, 2005. Google ScholarDigital Library
- M. Butler and C. Ferreira. A process compensation language. pages 61--76, 2000. Google ScholarDigital Library
- F. Cabrera et al. Web services transaction (ws-transaction). Microsoft, IBM etc, 2002.Google Scholar
- L. Cabrera et al. Web services business activity framework (ws-businessactivity). Specification, BEA Systems, IBM Corp., Microsoft Corp, 2004.Google Scholar
- S. Choi et al. A framework for ensuring consistency of web services transactions. Information and Software Technology, 50(7-8):684--696, 2008. Google ScholarDigital Library
- W. de Roever. The need for compositional proof systems: A survey. Compositionality: The Significant Difference, pages 1--22, 1998. Google ScholarDigital Library
- V. Diekert and G. Rozenberg. The book of traces. World Scientific Publishing Company Incorporated, 1995. Google ScholarDigital Library
- M. Droste and P. Gastin. The kleene-schutzenberger theorem for formal power series in partially commuting variables. Information and Computation, 153(1):47--80, 1999. Google ScholarDigital Library
- Edelkamp et al. Cost-algebraic heuristic search. In Proc. National Conference on Artificial Intelligence, volume 20, page 1362. Menlo Park, CA; Cambridge, MA; London; AAAI Press; MIT Press; 1999, 2005. Google ScholarDigital Library
- J. Fischer et al. Ensuring consistency in long running transactions. In Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering, pages 54--63. ACM, 2007. Google ScholarDigital Library
- L. Gao et al. A survey of transactional issues for web service composition and recovery. International Journal of Web and Grid Services, 7(4):331--356, 2011. Google ScholarDigital Library
- H. Garcia-Molina and K. Salem. Sagas. ACM SIGMOD Record, 16(3):249--259, 1987. Google ScholarDigital Library
- D. Giannakopoulou and J. Magee. Fluent model checking for event-based systems. In Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering, pages 257--266. ACM, 2003. Google ScholarDigital Library
- P. Godefroid et al. Partial-order methods for the verification of concurrent systems: an approach to the state-explosion problem, volume 1032. Springer, 1996. Google ScholarDigital Library
- J. Gray et al. The transaction concept: Virtues and limitations. In Proceedings of the Very Large Database Conference, pages 144--154, 1981. Google ScholarDigital Library
- P. Greenfield et al. Consistency for web services applications. In Proceedings of the 31st international conference on Very large data bases, page 1203. VLDB Endowment, 2005. Google ScholarDigital Library
- J. Henriksen et al. A theory of regular msc languages. Information and computation, 202(1):1--38, 2005. Google ScholarDigital Library
- R. ITU-T and Z. Recommendation. 120: Message sequence chart (msc). ITU-T, Geneva, 27, 1996.Google Scholar
- J. Kramer and J. McGee. Concurrency: State Models and Java Programs. 1999. Google ScholarDigital Library
- J. Li et al. Looking into compensable transactions. In Software Engineering Workshop, 2007. SEW 2007. 31st IEEE, pages 154--166. IEEE, 2007. Google ScholarDigital Library
- O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pages 97--107. ACM, 1985. Google ScholarDigital Library
- M. Little. Transactions and web services. Communications of the ACM, 46(10):49--54, 2003. Google ScholarDigital Library
- S. Mauw and M. Reniers. High-level message sequence charts. SDL, 97:291--306, 1997.Google Scholar
- A. Mazurkiewicz. Trace theory. Petri Nets: Applications and Relationships to Other Models of Concurrency, pages 278--324, 1987. Google ScholarDigital Library
- I. Meinecke. Weighted branching automata-Combining concurrency and weights. PhD thesis, Dissertation, Technische Universit¨at Dresden, Germany, 2004.Google Scholar
- R. Morin. On regular message sequence chart languages and relationships to mazurkiewicz trace theory. In Foundations of Software Science and Computation Structures, pages 332--346. Springer, 2001. Google ScholarDigital Library
- M. Papazoglou. Web services and business transactions. World Wide Web, 6(1):49--91, 2003. Google ScholarDigital Library
- M. Papazoglou and D. Georgakopoulos. Service-oriented computing. Communications of the ACM, 46(10):25--28, 2003. Google ScholarDigital Library
- P. Pires et al. Building reliable web services compositions. Lecture notes in computer science, pages 59--72, 2003. Google ScholarDigital Library
- A. Pnueli. The temporal logic of programs. In Foundations of Computer Science, 1977., 18th Annual Symposium on, pages 46--57. IEEE, 1977. Google ScholarDigital Library
- M. Potts et al. Business transaction protocol primer. OASIS Committee Supporting Document, 2002.Google Scholar
- F. Rabbi et al. Compensable workflow nets. Formal Methods and Software Engineering, pages 122--137, 2010. Google ScholarDigital Library
- H. Schmidt. Compatibility of interoperable objects. Information Systems Interoperability, pages 143--199, 1998.Google Scholar
- H. Schmidt et al. Modelling predictable component-based distributed control architectures. In Object-Oriented Real-Time Dependable Systems, 2003. WORDS 2003 Fall. Proceedings. Ninth IEEE International Workshop on, pages 339--346. IEEE, 2003.Google ScholarCross Ref
- H. W. Schmidt et al. Towards probabilistic mode automata for adaptable resource-aware component-based systems design. In Improving Systems and Software Engineering Conference (ISSEC) incorporating SEPG(SM) Asia-Pacific Conference 2012, pages 38--52, Melbourne, Australia, August 2012.Google Scholar
- B. Schmit and S. Dustdar. Towards transactional web services. In E-Commerce Technology Workshops, 2005. Seventh IEEE International Conference on, pages 12--20. IEEE, 2005. Google ScholarDigital Library
- P. Thiagarajan and J. Henriksen. Distributed versions of linear time temporal logic: A trace perspective. Lectures on Petri Nets I: Basic Models, pages 643--681, 1998. Google ScholarDigital Library
- S. Uchitel, J. Kramer, and J. Magee. Incremental elaboration of scenario-based specifications and behavior models using implied scenarios. ACM Transactions on Software Engineering and Methodology (TOSEM), 13(1):37--85, 2004. Google ScholarDigital Library
- L. Zeng et al. Qos-aware middleware for web services composition. Software Engineering, IEEE Transactions on, 30(5):311--327, 2004. Google ScholarDigital Library
- G. Zhou. Model checking inconsistency recovery costs. In Service-Oriented Computing-ICSOC 2011 Workshops, pages 195--200. Springer, 2012. Google ScholarDigital Library
Index Terms
- Towards cost-aware service recovery
Recommendations
Towards adaptive management of QoS-aware service compositions
Special Issue on "Advances in Grid services Engineering and Management"Service compositions enable users to realize their complex needs as a single request. Despite intensive research, especially in the area of business processes, web services and grids, an open and valid question is still how to manage service ...
Predictive Failure Recovery in Constraint-aware Web Service Composition
CLOSER 2017: Proceedings of the 7th International Conference on Cloud Computing and Services ScienceA large number of web service composition methods have been proposed. Most of them are based on the matching of input/output and QoS parameters. However, most services in the real world have conditions or restrictions that are imposed by their ...
The Impact of Service Semantics on the Consistent Recovery in SOA
ISPA '14: Proceedings of the 2014 IEEE International Symposium on Parallel and Distributed Processing with ApplicationsThis paper addresses a problem of consistent recovery of SOA processing. So far, the recovered state was considered as consistent if all events that have occurred before the failure were transparently recovered. However, providing such a strict ...
Comments