An approach for business transaction management

ABSTRACT

Business Transactions can be seen as a hierarchy of tasks, in which execution is orchestrated in order to manage the different interactions among implied services. Business Transactions are generally long running, consisting of sub-transactions that may fail or be cancelled. In addition, the problem also entails concurrent access to data available via Web services. There are many solutions, namely compensation and locking, as present in the "DBMSs" transactional model adapted to Business Process model. The locking restricts access and degrades the Quality of Service. Compensation can be complicated to implement and costly in terms of performance. Each one of these solutions has a cost. In this paper we propose a cost model for strategies based on locking and on compensation to compare them in the execution plan of a Business Transaction. This comparison allows us to choose the least expensive strategy.

REFERENCES

• 1: M. Papazoglou: Web services and business transactions, World Wide Web Journal 6, pages 49--91, 2003.
• 2: M. Butler, C. A. R. Hoare, and C. Ferreira.: A trace semantics for long-running transactions. In 25 Years Communicating Sequential Processes, pages 133--150, 2004.
• 3: M. Butler and C. Ferreira.: A process compensation language. In Integrated Formal Methods (IFM'2000), volume 1945 of LNCS, pages 61--76. Springer-Verlag, 2000.
• 4: M. Butler and C. Ferreira.: An operational semantics for StAC, a language for modelling long-running business transactions. Proc. of Coordination'04, volume 2949 of LNCS, pages 87--104. Springer, 2004
• 5: M. Butler, C. Ferreira, and M. Y.: Precise modelling of compensating business transactions and its application to PEL. Journal of Universal Computer Science, 712--743, May 2005.
• 6: B. Limthanmaphon, Y. Zhang: Web service composition transaction management. In Schewe, K. D., Williams, H., eds.: ADC. Volume 27 of CRPIT., Database Technologies 2004, Proceedings of the Fifteenth Australian Database Conference, ADC 2004, Dunedin, New Zealand, Australian Computer Society (2004)
• 7: T. Yu, and K. J.: Service Selection Algorithms for Web Services with End-to-end QoS Constraints, Journal of Information Systems and E-Business Management, Volume 3, Number 2, July 2005
• 8: J. Roberts, and K. Srinivasan: Tentative Hold Protocol Part 1: White Paper, W3C, http://www.w3.org/TR/tenthold-1, Note 28 November 2001.
• 9: J. Roberts, T. Collier, P. Malu, and K. Srinivasan: Tentative Hold Protocol Part2: Technical Specification, W3C, http://www.w3.org/TR/tenthold-2, Note 28 November 2001.
• 10: L. Baresi, S. Guinea: Towards dynamic monitoring of WS-BPEL processes. In: Proceedings of the Third International Conference on Service Oriented Computing, pp. 269--282. Springer, Amsterdam 2005
• 11: R. Khalaf, N. Mukhi, S. Weerawarana. Service-Oriented Composition in BPEL4WS. WWW2003 conference, Budapest, Hungary 2003.

INDEX TERMS

Keywords:
business transactions, compensation, locking, orchestration