Availability evaluation in distributed database systems

doi:10.1016/0166-5316(81)90001-8

Performance Evaluation

Volume 1, Issue 3, November 1981, Pages 201-211

https://doi.org/10.1016/0166-5316(81)90001-8 Get rights and content

Abstract

A quantitative method is presented for evaluating availability in Distributed Database Systems. The description of the distributed system and of transaction processing is given in terms of a flow graph. System states are repsented by a structure vector. Transitions between states are modeled as a Markov process. Solution techniques are discussed both for the case in which transition rates are independent of the system state and for the case in which they depend on it. Finally, the results for an example are given.

References (12)

P.A Alsberg et al.
A principle for resilient sharing of distributed resources
V Amoia et al.
Computer oriented formulation of transition rate matrices via Kronecker algebra
IEEE Trans. Reliability
(1981)
V Amoia et al.
On transition rate matrix eigenvalues
C Baldissera et al.
Basi di dati distribuite
Rivista di Informatica
(1979)
P.A Bernstein et al.
Formal aspects of serializability in database concurrency control
IEEE Trans. Software Engrg.
(1979)
D.K Gifford
Weighted voting for replicated data

There are more references available in the full text version of this article.

Cited by (5)

Measuring the effects of distributed database models on transaction availability measures
1992, Performance Evaluation
Data distribution, data replication and system reliability are key factors in determining the availability measures for transactions in distributed database systems. In order to simplify the evaluation of these measures, database designers and researchers tend to make unrealistic assumptions about these factors. In this article, we investigate the effect of such assumptions on the computational complexity and accuracy of such evaluations. We represent a database system with five parameters related to the above factors. Probabilistic analysis is employed to evaluate the availability of read-only and read-write transactions. We consider both the read-one/write-all and the majority-read/majority-write replication control policies. We conclude that transaction availability is more sensitive to variations in degrees of replication, less sensitive to data distribution, and insensitive to reliability variations in a nonhomogeneous system. The computational complexity of the evaluations is found to be mainly determined by the chosen distributed database model, while the accuracy of the results is not so much dependent on the models.
State dependency issues in evaluating distributed database availability
1984, Computer Networks (1976)
Quantitative evaluation of availability in distributed database systems must take into account both hardware and software failures. Therefore parameters such as the failure and the recovery probabilities must be evaluated for each “component” of the system.
The most difficult problems arise when the evaluation procedure has to deal with failure mechanisms which functionally depend on the state of the system.
In this paper, after a short introduction to a general methodology for availability evaluation, an example of state-dependent fault mechanism is described together with a technique for evaluating its impact on the life of the whole system.
Reliability of data allocation on a centralized service configuration with distributed servers
2006, Computer Journal
Information Systems: A Challenge for Computers and Communications Reliability
1986, IEEE Journal on Selected Areas in Communications
An Availability Model for Distributed Transaction Systems
1985, IEEE Transactions on Software Engineering

^☆: This work is part of the DATANET project supported by the Italian National Research Council.

^∗∗: Present address: Arthur Anderson and Co., via Hoepli, Milano, Italy.

View full text

Availability evaluation in distributed database systems☆

Abstract

A principle for resilient sharing of distributed resources

Computer oriented formulation of transition rate matrices via Kronecker algebra

IEEE Trans. Reliability

On transition rate matrix eigenvalues

Basi di dati distribuite

Rivista di Informatica

Formal aspects of serializability in database concurrency control

IEEE Trans. Software Engrg.

Weighted voting for replicated data