Abstract
The two-phase commit (2PC) protocol (or its variation) is widely employed for commit processing in distributed data base systems (DDBSs). The blocking phenomena in 2PC reduces the availability of the system as the blocked transactions keep all the resources until they receive the final command from the coordinator after its recovery. To remove the blocking problem in 2PC, three phase commit (3PC) protocol was proposed. Although 3PC protocol eliminates the blocking problem, it involves an extra round of message transmission, which degrades the performance in DDBS (Internet environments).
To reduce blocking, we propose a backup commit (BC) protocol by attaching multiple backup sites to the coordinator site. In this protocol, after receiving responses from all participants in the first phase, the coordinator communicates the final decision to the backup sites in the backup phase. Afterwards, it sends the final decision to the participants. When blocking occurs due to the failure of the coordinator site, the participant sites can terminate the transaction by consulting a backup site of the coordinator. In this way, the BC protocol achieves non-blocking property in most of the coordinator site failures.
The BC protocol suits best for World Wide Web (or Internet) environments where a server has to face high rush of electronic commerce transactions that involve multiple participants. Also in the Internet environment, sites fail frequently and messages take longer delivery time. In this situation with extra hardware, the BC protocol reduces the blocking problem without involving expensive communication cycle as compared to 3PC. Through simulation experiments it has been shown that the BC protocol exhibits superior throughput and response time performance over the 3PC protocol and performs closely with the 2PC protocol.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Agrawal, M. J. Carey and M. Livny, “Concurrency control performance modeling: alternatives and implications”, ACM Transactions on Database Systems, vol.12, no.4, December 1987, pp. 609–654.
Y. Al-Houmaily and P. Chrysanthis, “Two-phase commit in giga-bit networked distributed databases”, proceedings of 8th International Conference on Parallel and Distributed Computing Systems, September 1995.
B. Bhargava, Y. Zhang, S. Goel, “A study of distributed transaction processing in an internetwork”, Volume 1006 of Lecture Notes in Computer Science, Springer-Verlag, 1995, pp. 135–152.
P.A. Bernstein, V. Hadzilacos and N. Goodman, Concurrency control and recovery in database systems, Addison-Wesley, 1987.
Alok N. Choudhary, Cost of distributed deadlock detection:A performance study, in 1990 proc. of IEEE Conference on Data Engineering, 1990, pp.174–181.
Michael Hammer and David Shipman, “Reliability mechanisms for SDD-1: A system for distributed databases”, ACM Transactions on Database Systems, vol.5, no.4, December 1980, pp.431–466.
J. N. Gray, “Notes on database operating systems: in operating systems an advanced course”, Volume 60 of Lecture Notes in Computer Science, 1978, pp. 393–481.
P. Krishna Reddy and Masaru Kitsuregawa, Reducing the blocking in two-phase commit protocol employing backup sites. Proceedings 3rd IFCIS International Conference on Cooperative Information Systems (CoopIS’98), 1998, pp 406–415.
Idit Keider and Danny Dolev, “Increasing the resilience of atomic commit, at no additional cost”, in proc. of the Fourteenth ACM SIGACT-SIGMOD-SIGAR Symposium on Principles of Database Systems, 1995, pp.245–254.
C. Mohan, B. Lindsay and R. Obermark, “Transaction management in the R* distributed database management system”, ACM Transactions on Database Systems, vol.11, no.4, 1994.
Ramesh Gupta, Jayant Haritsa and Kirti Ramamritam, “Revisiting commit processing in distributed database systems”, ACM SIGMOD, 1997, pp. 486–497.
G. Samaras, K. Britton, A. Citron, and C. Mohan, “Two-phase commit optimizations in a commercial distributed environment”, Journal of Distributed and Parallel Databases, vol.3, no.4, 1995.
P. Spiro, A. Joshi, and T. K. Rangarajan, “Designing an optimized transaction commit protocol”, Digital Technical Journal, 1991.
D. Skeen, “A quorum-based commit protocol”, in proc. of 6th Berkeley Workshop on Distributed Data Management and Computer Networks, February 1982, pp. 69–80.
D. Skeen and M. Stonebraker, “A formal model of crash recovery in a distributed system”, IEEE Transactions on Software Engineering, vol.SE-9, no.3, 1983, pp.219–227.
J. Stamos and F. Cristian, “Coordinator log transaction execution protocol”, Journal of Distributed and Parallel Databases, 1993, pp.383–408.
M. Tamer Ozsu and Patrick Valduriez, Principles of distributed database systems, Prentice-Hall, 1991.
J. Lyon, K. Evans and J. Klein, Transaction internet protocol, version 3.0, “http://www.faqs.org/rfcs/rfc2371.html”.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krishna Reddy, P., Kitsuregawa, M. (2000). Blocking Reduction in Two-Phase Commit Protocol with Multiple Backup Sites. In: Bhalla, S. (eds) Databases in Networked Information Systems. DNIS 2000. Lecture Notes in Computer Science, vol 1966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44431-9_15
Download citation
DOI: https://doi.org/10.1007/3-540-44431-9_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41395-0
Online ISBN: 978-3-540-44431-2
eBook Packages: Springer Book Archive