A Loosely Coupled Distributed System for Reliably Storing Data

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 addi...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on software engineering 1985-05, Vol.SE-11 (5), p.446-454
1. Verfasser:	Bernstein, A.J.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm design and analysis Algorithms Applied sciences Broadcast network Broadcasting Communication Computer crashes Computer science control theory systems Computer systems and distributed systems. User interface Concurrency control Data analysis Distributed processing Engineering Exact sciences and technology Failure Failure analysis Information storage Markov analysis multiple copy database Networks Performance analysis Procedures Redundancy Reliability Software stable storage Telecommunication network reliability Transaction databases Voting voting algorithm
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	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.
ISSN:	0098-5589 1939-3520
DOI:	10.1109/TSE.1985.232483