This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
May 1985 (vol. 11 no. 5)
pp. 446-454
A.J. Bernstein, Department of Computer Science, State University of New York
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.
Index Terms:
voting algorithm, Broadcast network, Markov analysis, multiple copy database, redundancy, reliability, stable storage
Citation:
A.J. Bernstein, "A Loosely Coupled Distributed System for Reliably Storing Data," IEEE Transactions on Software Engineering, vol. 11, no. 5, pp. 446-454, May 1985, doi:10.1109/TSE.1985.232483
Usage of this product signifies your acceptance of the Terms of Use.