Adaptive replication control based on consensus

Fritzke, Udo; Valentim, Rodrigo Pereira; Gomes, Luiz Alberto Ferreira

doi:10.1145/1435523.1435524

Cited by 4 publications

(3 citation statements)

References 32 publications

(55 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…With respect to the meta protocol, some safety properties must be ensured, in spite of concurrent protocol replacement requests and session executions. These properties are formalized in [1]. For this, were defined pointcuts (arrow 1 on Figure 1) on JDBC APIs for session initialization, session disconnection and data updates.…”

Section: Design Solutionsmentioning

confidence: 99%

Structuring adaptive replicated systems with design patterns and aspects

Couto

Valentim

Fritzke

et al. 2011

Proceedings of the 2011 ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

The construction of adaptive replicated systems, in which the replication control protocols can be replaced at runtime, requires to face with complex structural concerns that include: (i) the integration of replication control protocols with the application code, (ii) the the interchangeability of protocol variants, (iii) the observation and handling of events in a distributed system, and (iv) the consistency of the replication control mechanism. In this paper, we show a way to tackle that complexity with the help of Design Patterns and Aspect Oriented Programming (AOP).

show abstract

Section: Design Solutionsmentioning

confidence: 99%

Structuring adaptive replicated systems with design patterns and aspects

Couto

Valentim

Fritzke

et al. 2011

Proceedings of the 2011 ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…The general problem of protocol exchange, or dynamic protocol update (abbr., DPU), has been broadly discussed [16,27,47,113]. However, DPU solutions provide adaptability by replacing the working protocol by means of some type of synchronization between nodes, and do not consider protocol concurrency (except, perhaps, for a short transition phase).…”

Section: Related Workmentioning

confidence: 99%

“…Fritzke et al [47] also focus on DPU in the context of database replication. They provide adaptability to mobile systems, where disconnected nodes can work with weak consistency levels but switch to stronger levels when connected.…”

Section: Related Workmentioning

confidence: 99%

On the Consistency, Characterization, Adaptability and Integrity of Database Replication Systems

Fuertes¹,

Idoia²

View full text Add to dashboard Cite

Since the appearance of the first distributed databases until the current modern replication systems, the research community has proposed multiple protocols to manage data distribution and replication, along with concurrency control algorithms to handle transactions running at every system node. Many protocols are thus available, each one with different features and performance, and guaranteeing different consistency levels. To know which replication protocol is the most appropriate, two aspects must be considered: the required level of consistency and isolation (i.e., the correctness criterion), and the properties of the system (i.e., the scenario), which will determine the achievable performance.Regarding correctness criteria, one-copy serializability is broadly accepted as the highest level of correctness. However, its definition allows different interpretations regarding replica consistency. In this thesis, we establish a correspondence between memory consistency models, as defined in the scope of distributed shared memory, and possible levels of replica consistency, thus defining new correctness criteria that correspond to the identified interpretations of one-copy serializability.Once selected the correctness criterion, the achievable performance of a system heavily depends on the scenario, i.e., the sum of both the system environment and the applications running on it. In order for the administrator to select a proper replication protocol, the available protocols must be fully and deeply known. A good description of each candidate is fundamental, but a common ground is mandatory to compare the different options and to estimate their performance in the given scenario. This thesis proposes a precise characterization model that allows us to decompose algorithms into individual interactions between significant system elements, as well as to define some underlying properties, and to associate v each interaction with a specific policy that governs it. We later use this model as basis for a historical study of the evolution of database replication techniques, thus providing an exhaustive survey of the principal existing systems.Although a specific replication protocol may be the best option for certain scenario, as systems are dynamic and heterogeneous, it is difficult for a single protocol to continuously be the proper choice, as it may degrade or be unable to meet all requirements. In this thesis we propose a metaprotocol that supports several replication protocols which follow different replication techniques and may provide different isolation levels. With this metaprotocol, replication protocols can either work concurrently with the same data or be sequenced for adapting to dynamic environments.Finally we consider integrity constraints, which are extensively used in databases to define semantic properties of data but are often forgotten in replicated databases. We analyze the potential problems this may involve and provide simple guidelines to extend a protocol so that it notices and properly manage...

show abstract