Dynamic Replica Control Based on Fairly Assigned Variation of Data for Loosely Coupled Distributed Database Systems

This paper proposes a decentralized and asynchronous replica control method based on a fair assignment of the variation in numerical data that has weak consistency for loosely coupled database systems managed or used by different organizations of human activity. Our method eliminates the asynchronous abort of already committed transactions even if replicas in all network partitions continue to process transactions when network partitioning occurs. A decentralized and asynchronous approach is needed because it is difficult to keep a number of loosely coupled systems in working order, and replica operations performed in a centralized and synchronous way can degrade the performance of transaction processing. We eliminate the transaction abort by fairly distributing the variation in numerical data to replicas according to their demands and updating the distributed variation using only asynchronously propagated update transactions without calculating the precise global state among reachable replicas. In addition, fairly assigning the variation of data to replicas equalizes the disadvantages of processing update transactions among replicas. Fairness control for assigning the data variation is performed by averaging the variation requested by the replicas. A simulation showed that our system can achieve extremely high performance for processing update transactions and fairness among replicas. key words: data replication, weak consistency, numerical data, fairness, clock synchronization

[1]  Richard A. Golding.  Weak consistency group communication for wide-area systems , 1992, [1992 Proceedings] Second Workshop on the Management of Replicated Data.

[2]  Bharat K. Bhargava,et al.  Replication Techniques in Distributed Systems , 1996, Advances in Database Systems.

[3]  Andrew S. Tanenbaum,et al.  Computer Networks , 1981 .

[4]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[5]  Patrick E. O'Neil,et al.  The Escrow transactional method , 1986, TODS.

[6]  Philip S. Yu,et al.  Divergence Control Algorithms for Epsilon Serializability , 1997, IEEE Trans. Knowl. Data Eng..

[7]  Satoshi Ono,et al.  View divergence control of replicated data using update delay estimation , 1999, Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems.

[8]  S. Ono,et al.  A statistical method for time synchronization of computer clocks with precisely frequency-synchronized oscillators , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[9]  Dennis Shasha,et al.  The dangers of replication and a solution , 1996, SIGMOD '96.

[10]  Michael J. Fischer,et al.  Sacrificing serializability to attain high availability of data in an unreliable network , 1982, PODS.

[11]  D. Du,et al.  Combinatorial Network Theory , 1996 .

[12]  Judah Levine.  Precision synchronization of computer network clocks , 1997 .

[13]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

[14]  Calton Pu,et al.  A Formal Characterization of Epsilon Serializability , 1995, IEEE Trans. Knowl. Data Eng..

[15]  Abraham Silberschatz,et al.  Data-valued partitioning and virtual messages (extended abstract) , 1990, PODS.

[16]  Philip S. Yu,et al.  Distributed divergence control for epsilon serializability , 1993, [1993] Proceedings. The 13th International Conference on Distributed Computing Systems.

[17]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[18]  Amin Vahdat,et al.  Efficient Numerical Error Bounding for Replicated Network Services , 2000, VLDB.

[19]  Calton Pu,et al.  Autonomous transaction execution with epsilon serializability , 1992, [1992 Proceedings] Second International Workshop on Research Issues on Data Engineering: Transaction and Query Processing.

[20]  Judah Levine,et al.  An algorithm to synchronize the time of a computer to universal time , 1995, TNET.

[21]  Roger M. Needham,et al.  Grapevine: an exercise in distributed computing , 1982, CACM.

[22]  Banu Özden,et al.  Design and evaluation of redistribution strategies for wide-area commodity distribution , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[23]  Brian D. Noble,et al.  Fast reconciliations in fluid replication , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[24]  Marvin Theimer,et al.  Managing update conflicts in Bayou, a weakly connected replicated storage system , 1995, SOSP.