From Total Order to Database Replication

This paper presents in detail an efficient and provably correct algorithm for database replication over partitionable networks. Our algorithm avoids the need for end-toend acknowledgments for each action while supporting network partitions and merges and allowing dynamic instantiation of new replicas. One round of end-to-end acknowledgments is required only upon a membership change event such as a network partition. New actions may be introduced to the system at any point, not only while in a primary component. We show how performance can be further improved for applications that allow relaxation of consistency requirements. We provide experimental results that demonstrate the efficiency of our approach.

• Type: Conference
• Year: 2002
• Where: ICDCS
• Authors: Yair Amir, Ciprian Tutu
• Keywords: Distributed And Parallel Computing, End-to-end Acknowledgments, End-toend Acknowledgments, ICDCS 2002, Network Partition