A Loosely Coupled Distributed System for Reliably Storing Data

1 May 1985

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering

Vol. SE-11 (5) , 446-454
https://doi.org/10.1109/TSE.1985.232483

Abstract

An algorithm for storing information redundantly on the nodes of a broadcast network is proposed. A voting technique is used to increase reliability. Since multiple votes are cast only when copies of a data item disagree, the algorithm has the property that communication overhead is minimal. In addition, nodes storing erroneous copies are automatically resynchronized. A Markov analysis is performed which relates parameters of the algorithm to the mean time to failure.

Keywords

TELECOMMUNICATION NETWORK RELIABILITY
VOTING
COMPUTER CRASHES
BROADCASTING
ALGORITHM DESIGN AND ANALYSIS
TRANSACTION DATABASES
FAILURE ANALYSIS
PERFORMANCE ANALYSIS
DATA ANALYSIS
REDUNDANCY

This publication has 0 references indexed in Scilit: