ABSTRACT
Critical database applications require 2-safe replication between at least two sites for disaster-tolerant services. At the same time, they must provide consistent and low-latency results to their clients in normal cases. In this paper, we propose Optimistic Transactional Active Replication (OTAR), which replicates the transaction logs with low latency and provides a consistent view to database applications. The latency of our replication is lower than Passive Replication, and guarantees the serializability of transaction isolation levels that cannot be supported by Active Replication. For our replication, each client sends a transaction request to all replicas and all of the replicas execute the request and optimistically return the result of the transaction to the client. Each replica generates a causality history of the transaction, sent to the client with the result. With the causality histories, the client can make sure that the requested transaction was executed in the same order at all of the replicas and eventually commit it. If the client cannot validate the order, then the client waits for the pessimistic result of the transaction from the replicas. This paper describes the algorithm and its properties.
- J. Lyon, Design Considerations in Replicated Database Systems for Disaster Protection, IEEE Compcon, 1988.Google Scholar
- F. Pedone, R. Guerraoui, and A. Schiper, The database state machine approach, Journal of Distributed and Parallel Databases and Technology, 2002. Google ScholarDigital Library
- F. B. Schneider, Implementing Fault-Tolerant Services Using the State Machine Approach: A tutorial, ACM Computing Surveys (CSUR), Vol.22 No.4, pp.299--319, 1990 Google ScholarDigital Library
- K. Hu, S. Mehrotra, and S. Kaplan, An Optimized Two-Safe Approach to Maintain Remote Backup Systems, Procs. of Conference on Management of Data, 1997.Google Scholar
- S. Fr'ulund and R. Guerraoui, Implementing E-Transactions with Asynchronous Replication, IEEE Trans. on Parallel and Distributed Systems, Vol.12, No.2, Feb.2001. Google ScholarDigital Library
- F. Cristian, Understanding Fault-Tolerant Distributed Systems, Communications of the ACM, Vol. 34, No.2, pp. 56--78, Feb, 1991. Google ScholarDigital Library
- X. Defago, A. Schiper and P. Urban, Total Order Broadcast and Multicast Algorithms: Taxonomy and Survey, ACM Computing Surveys, ACM Press, Vol. 36, No. 4, pp. 372--421, 2004. Google ScholarDigital Library
- W. Zhao, L. E. Mose, and P. M. Melliar-Smith, Unification of Transactions and Replication in Three-Tier Architectures Based on CORBA, IEEE Trans. on Dependable and Secure Computing, Vol. 2, No. 1, 2005 Google ScholarDigital Library
- R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat, Lazy Replication, Exploiting the Semantics of Distributed Services, Procs. of the 9th annual ACM Symposium on Principles of Distributed Computing, 1990. Google ScholarDigital Library
- R. Ladin, Providing High Availability Using Lazy Replication, ACM Transactions on Computer Systems, Vol. 10, 1992. Google ScholarDigital Library
- J. Gray and A. Reuter, Transaction Processing Concepts and techniques, Morgan Kaufmann Publishers Inc., San Francisco, CA, 1992. Google ScholarDigital Library
- Y. Breitbart and H. F. Korth, Replication and Consistency: Being Lazy Helps Sometimes, PODS' 97 Google ScholarDigital Library
- T. Anderson, Y. Breitbart, H. F. Korth, and A. Wool, Replication, Consistency, and Practicality: Are These Mutually Exclusive?, Proc. of ACM SIGMOD International Conference on Management of Data, pp. 484--495, June 1998 Google ScholarDigital Library
- P. Felber, A. Schiper, Optimistic Active Replication, Procs. of the 21st International Conference on Distributed ComputingGoogle Scholar
- B. Kemme, F. Pedoney, G. Alonso, and A. Schiper, Processing Transactions over Optimistic Atomic Broadcast Protocols, Procs. of the 19th IEEE International Conference on Distributed Computing Systems, pp. 424--431, 1999 Google ScholarDigital Library
- B. Kemme and G. Alonso, A New Approach to Developing and Implementing Eager Database Replication Protocols, ACM Trans on Database Systems, Vol. 25 No. 3, pp. 333--379, 2000. Google ScholarDigital Library
- B. Kemme, F. Pedone, G. Alonso, and A. Schiper, Using Optimistic Atomic Broadcast in Transaction Processing Systems, IEEE Trans. on Knowledge and Data Engineering, Vol. 15, No. 4, 2003. Google ScholarDigital Library
Index Terms
- Optimistic transactional active replication
Recommendations
Optimistic replication
Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work ...
Logless one-phase commit made possible for highly-available datastores
AbstractHighly-available datastores are widely deployed for Internet-based applications. However, many Internet-based applications are not contented with the simple data access interface provided by highly-available datastores. Distributed transaction ...
A Novel Algorithm of Managing Replication and Transaction through Read-one-Write-All Monitoring Synchronization Transaction System (ROWA-MSTS)
NETAPPS '10: Proceedings of the 2010 Second International Conference on Network Applications, Protocols and ServicesThe birth of remarkable advance in the development of computer and hardware in computer world has enables us to access information anytime and anywhere regardless of the geography factor. Therefore, replication in distributed system environment has ...
Comments