Document Type
Article
Publication Date
2-2008
Publication Title
IEEE Transactions on Parallel and Distributed Systems
Abstract
With the advent of the new generation of Internet-based technology, in particular, web services, the automation of business activities that are distributed across multiple enterprises becomes possible. Business activities are different from traditional transactions in that they are typically asynchronous, loosely coupled, and long running. Therefore, extended transaction protocols are needed to coordinate business activities that span multiple enterprises. Existing extended transaction protocols typically rely on compensating transactions to handle exceptional conditions. In this paper, we identify a number of issues with compensation-based extended transaction protocols and describe a reservation-based extended transaction protocol that addresses those issues. Moreover, we define a set of properties, analogous to the ACID properties of traditional transactions that are more appropriate for business activities that span multiple enterprises. In addition, we compare our reservation protocol with other extended transaction protocols for coordinating business activities and present performance analyses and results.
Repository Citation
Zhao, Wenbing; Moser, Louise E.; and Melliar-Smith, P. Michale, "A Reservation-Based Extended Transaction Protocol" (2008). Electrical and Computer Engineering Faculty Publications. 106.
https://engagedscholarship.csuohio.edu/enece_facpub/106
Original Citation
Wenbing, Z. Y., Moser, L. E., & Melliar-Smith, P. M. (n.d.). A Reservation-Based Extended Transaction Protocol. IEEE Transactions on Parallel and Distributed Systems, 19, 2, 188-203.
DOI
10.1109/TPDS.2007.70727
Version
Postprint
Publisher's Statement
© 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.
Volume
19
Issue
2
