A compensation cost-aware coordination for distributed long running transactions

Abstract

Web Service technologies make the automation of business activities that are distributed across multiple enterprises possible. Existing extended transaction protocols typically resort to compensation actions to regain atomicity and consistency. Firstly, a reservation-based transaction protocol is proposed to reduce compensation risk by preventing from concurrent conflicts. And time constraint is imposed on reservation to enhance the performance. Secondly, we theoretically illustrate a scheduling scheme that tries to satisfy various constraints as well as gain an optimized execution plan with minimum compensation cost. The specific solution is devised on a fundamental Serial Long Running Transaction (SLRT) Model and collected transactional properties of component services. Based on these conditions, a probabilistic cost evaluation method is defined. Finally, performance evaluation is conducted to prove the effectiveness of optimized schedule. © Springer-Verlag Berlin Heidelberg 2014.