Using Permuted States and Validated Simulation to Analyze Conflict Rates in Optimistic Replication

Optimistic replication provides high data availability in the presence of network outages. Although widely deployed, this relaXed consistency model introduces concurrent updates, whose behavior is poorly understood due to the vast state space. This paper introduces the notion of permuted states to eliminate system states that are redundant and unreachable, which can constitute the majority of states (4069 out of 4096 for four replicas). With the aid of permuted states, we are for the first time able to construct analytical models beyond the two-replica case. By eXamining the analysis for 2 to 4 replicas, we can demystify the process of forming identical conflicts—the most common conflict type at high replication factors. Additionally, we have automated and optimized the generation of permuted states, which allows us to eXplore higher replication factors (up to 10 replicas) using hybrid techniques. It also allows us to validate our results with eXisting simulations based on actual replication mechanisms, which previously were analytically validated with only one pair of replicas. Finally, we have discovered that update locality and bimodal access patterns are the primary factors contributing to the formation of identical conflicts.

[1]  Steven Skiena,et al.  Implementing discrete mathematics - combinatorics and graph theory with Mathematica , 1990 .

[2]  Dean Daniels,et al.  Oracle's symmetric replication technology and implications for application design , 1994, SIGMOD '94.

[3]  Mahadev Satyanarayanan,et al.  Disconnected Operation in the Coda File System , 1999, Mobidata.

[4]  John S. Heidemann,et al.  Resolving File Conflicts in the Ficus File System , 1994, USENIX Summer.

[5]  Irene Greif,et al.  Replicated document management in a group communication system , 1988, CSCW '88.

[6]  Ashish Goel,et al.  Perspectives on optimistically replicated, peer‐to‐peer filing , 1998, Softw. Pract. Exp..

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

[8]  Amin Vahdat,et al.  Design and evaluation of a continuous consistency model for replicated services , 2000, OSDI.

[9]  Mahadev Satyanarayanan,et al.  Flexible and Safe Resolution of File Conflicts , 1995, USENIX.

[10]  Antony I. T. Rowstron,et al.  Probabilistic modelling of replica divergence , 2001, Proceedings Eighth Workshop on Hot Topics in Operating Systems.

[11]  Gerald J. Popek,et al.  Consistency algorithms for optimistic replication , 1993, 1993 International Conference on Network Protocols.

[12]  Mario Vento,et al.  A Performance Comparison of Five Algorithms for Graph Isomorphism , 2001 .

[13]  Mahadev Satyanarayanan,et al.  Coda: A Highly Available File System for a Distributed Workstation Environment , 1990, IEEE Trans. Computers.

[14]  Anoop Gupta,et al.  Proceedings of the ninth international conference on Architectural support for programming languages and operating systems , 2000, ASPLOS 2000.

[15]  Peter L. Reiher,et al.  A simulation evaluation of optimistic replicated filing in mobile environments , 1999, 1999 IEEE International Performance, Computing and Communications Conference (Cat. No.99CH36305).

[16]  Ben Y. Zhao,et al.  OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.

[17]  Geoffrey H. Kuenning,et al.  Understanding the behavior of the conflict-rate metric in optimistic peer replication , 2002, Proceedings. 13th International Workshop on Database and Expert Systems Applications.

[18]  Peter Reiher,et al.  Perspectives on optimistically replicated, peer‐to‐peer filing , 1998 .

[19]  Richard A. Golding,et al.  Weak-consistency group communication and membership , 1992 .

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