A System Architecture for Enhanced Availability of Tightly Coupled Distributed Systems

Authors:
J. Osrael;L. Froihofer;K. M. Goeschka;S. Beyer;P. Galdamez;F. Munoz
Affiliations:
Vienna University of Technology;Vienna University of Technology;Vienna University of Technology;Universidad Politecnica de Valencia, Spain;Universidad Politecnica de Valencia, Spain;Universidad Politecnica de Valencia, Spain
Venue:
ARES '06 Proceedings of the First International Conference on Availability, Reliability and Security
Year:
2006

Citing 0
Cited 8

What service replication middleware can learn from object replication middleware

Proceedings of the 1st workshop on Middleware for Service Oriented Computing (MW4SOC 2006)
Middleware support for adaptive dependability

Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Highly available fault tolerant distributed computing using reflection and replication

Proceedings of the International Conference on Advances in Computing, Communication and Control
Exploiting commutativity for efficient replication in partitionable distributed systems

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Middleware support for adaptive dependability

MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Adaptive voting for balancing data integrity with availability

OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
Increasing availability in a replicated partitionable distributed object system

ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Self-adaptive and reconfigurable distributed computing systems

Applied Soft Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a system architecture which facilitates enhanced availability of tightly coupled distributed systems by temporarily relaxing constraint consistency. Three different types of consistency are distinguished in tightly coupled distributed systems - replica consistency, concurrency consistency, and constraint consistency. Constraint consistency defines the correctness of the system with respect to a set of data integrity rules (application defined predicates). Traditional systems either guarantee strong constraint consistency or no constraint consistency at all. However, a class of systems exists, where data integrity can be temporarily relaxed in order to enhance availability, i.e. constraint consistency can be traded against availability. This allows for a context- and situation-specific optimum of availability. This paper presents the basic concepts of the trading process and the proposed system architecture to enable a fine-grained tuning of the trade-off in tightly coupled distributed systems.