ResearchIndex

abstract:

This paper describes a new replication algorithm that is able to tolerate Byzantine faults. We believe that Byzantinefault -tolerant algorithms will be increasingly important in the future because malicious attacks and software errors are increasingly common and can cause faulty nodes to exhibit arbitrary behavior. Whereas previous algorithms assumed a synchronous system or were too slow to be used in practice, the algorithm described in this paper is practical: it works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude. We implemented a Byzantine-fault-tolerant NFS service using our algorithm and measured its performance. The results show that our service is only 3% slower than a standard unreplicated NFS. 1 Introduction Malicious attacks and software errors are increasingly common. The growing reliance of industry and government on online information...

publisher:

USENIX

pages:

173--186

school:

Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science

editor:

{USENIX}

booktitle:

Proceedings of the 3rd Symposium on Operating Systans Design and Implementation ({OSDI}-99)

type:

misc

year:

1999

annote:

Miguel Castro (Laboratory for Computer Science,; Massachusetts Institute of Technology; 545 Technology Square , Cambridge , MA 02139); Barbara Liskov (Laboratory for Computer Science,; Massachusetts Institute of Technology; 545 Technology Square

address:

Berkeley, CA

month:

jan # "~20

volume:

32(5)

series:

Operating Systems Review