|
Abstract - Technical Program - OSDI 99
Practical Byzantine Fault Tolerance
Miguel Castro, Barbara Liskov
Massachusetts Institute of Technology
Abstract
This paper describes a new replication algorithm that is able to
tolerate Byzantine faults. We believe that Byzantine-fault-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.
- View the full text of this paper in
HTML form.
- If you need the latest Adobe Acrobat Reader, you can download it from Adobe's site.
- To become a USENIX Member, please see our Membership Information.
|
Need help? Use our Contacts page.
Technical Program